gaimc : Graph Algorithms In Matlab Code

버전 1.0.0.0 (650 KB) 작성자: David Gleich
Efficient pure-Matlab implementations of graph algorithms to complement MatlabBGL's mex functions.
다운로드 수: 21.5K
업데이트 날짜: 2009/5/16

라이선스 없음

While MatlabBGL uses the Boost Graph Library for efficient graph routines,
gaimc implements everything in pure Matlab code. While the routines are
slower, they aren't as slow as I initially thought. Since people often
have problems getting MatlabBGL to compile on new versions of Matlab
or on new architectures, this library is then a complement to MatlabBGL.

See the published M-files for a few examples of the capabilities.

Functions
depth first search (dfs)
breadth first search (bfs)
connected components (scomponents)
maximum weight bipartite matching (bipartite_matching)
Dijkstra's shortest paths (dijkstra)
Prim's minimum spanning tree (mst_prim)
clustering coefficients (clustercoeffs)
directed clustering coefficients (dirclustercoeffs)
core numbers (corenums)

The project is maintained at github : http://github.com/dgleich/gaimc/tree/master

인용 양식

David Gleich (2024). gaimc : Graph Algorithms In Matlab Code (https://www.mathworks.com/matlabcentral/fileexchange/24134-gaimc-graph-algorithms-in-matlab-code), MATLAB Central File Exchange. 검색됨 .

MATLAB 릴리스 호환 정보
개발 환경: R2007b
모든 릴리스와 호환
플랫폼 호환성
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
버전 게시됨 릴리스 정보
1.0.0.0