No BSD License  

Highlights from
gaimc : Graph Algorithms In Matlab Code

image thumbnail

gaimc : Graph Algorithms In Matlab Code

by

David Gleich (view profile)

 

Efficient pure-Matlab implementations of graph algorithms to complement MatlabBGL's mex functions.

Contents.m
%=========================================
% Graph Algorithms in Matlab Code (gaimc)
%   Written by David Gleich
%   Version 1.0 (beta)
%   2008-2009
%=========================================
%
% Search algorithms
% dfs                        - depth first search
% bfs                        - breadth first search
%
% Shortest path algorithms
% dijkstra                   - Dijkstra's shortest path algorithm
%
% Minimum spanning tree algorithms
% mst_prim                   - Compute an MST using Prim's algorithm
%
% Matching
% bipartite_matching         - Compute a maximum weight bipartite matching
%
% Connected components
% scomponents                - Compute strongly connected components
% largest_component          - Selects only the largest component
% 
% Statistics
% clustercoeffs              - Compute clustering coefficients
% dirclustercoeffs           - Compute directed clustering coefficients
% corenums                   - Compute core numbers
%
% Drawing
% graph_draw                 - Draw an adjacency matrix (from Leon Peshkin)
%
% Helper functions
% sparse_to_csr              - Compressed sparse row arrays from a matrix
% csr_to_sparse              - Convert back to Matlab sparse matrices
% load_gaimc_graph           - Loads a sample graph from the library

% David F. Gleich
% Copyright, Stanford University, 2008-2009

% History
% 2008-04-10: Initial version


% TODO for release
% Fix mlintrpt errors


% Future todos
% Implement weighted core nums
% More testing
% Implement all pairs shortest paths with Floyd Warshall

Contact us