image thumbnail

gaimc : Graph Algorithms In Matlab Code

version 1.0.0.0 (650 KB) by David Gleich
Efficient pure-Matlab implementations of graph algorithms to complement MatlabBGL's mex functions.

21.1K Downloads

Updated 16 May 2009

No License

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

Cite As

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

MATLAB Release Compatibility
Created with R2007b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Acknowledgements

Inspired by: MatlabBGL

Inspired: Jorsorokin/HDBSCAN, FGT - Fold Geometry Toolbox

Community Treasure Hunt

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

Start Hunting!