No BSD License
-
Compare performance of gaimc ...
-
Demo of gaimc - 'Graph Algori...
-
The US airport network
-
[cc cccyc ccmid ccin ccout nf...
DIRCLUSTERCOEFFS Compute clustering coefficients for a directed graph
-
[d pred]=dijkstra(A,u)
DIJKSTRA Compute shortest paths using Dijkstra's algorithm
-
[d rt]=corenums(A)
CORENUMS Compute the core number for each vertex in the graph.
-
[rp ci ai ncol]=sparse_to_csr...
SPARSE_TO_CSR Convert a sparse matrix into compressed row storage arrays
-
[val m1 m2 mi]=bipartite_matc...
BIPARTITE_MATCHING Solve a maximum weight bipartite matching problem
-
bfs(A,u,target)
BFS Compute breadth first search distances, times, and tree for a graph
-
cc=clustercoeffs(A,weighted,n...
CLUSTERCOEFFS Compute undirected clustering coefficients for a graph
-
convert_sparse(A)
CONVERT_SPARSE Convert a sparse matrix to the native gaimc representation
-
csr_to_sparse(rp,ci,ai,ncols)
CSR_TO_SPARSE Convert from compressed row arrays to a sparse matrix
-
dfs(A,u,full,target)
DFS Compute depth first search distances, times, and tree for a graph
-
graph_draw(adj, xy, varargin)
GRAPH_DRAW Draw a picture of a graph when the coordinates are known
-
largest_component(A,sym)
LARGEST_COMPONENT Return the largest connected component of A
-
load_test_gaimc_graph
-
scomponents(A)
SCOMPONENTS Compute the strongly connected components of a graph
-
test_bfs
-
test_bipartite_matching
Info
-
test_corenums
-
test_csr_to_sparse
empty arguments
-
test_dfs
Line graph test
-
test_largest_component
-
test_main
TODO Check the directory
-
test_sparse_to_csr
Previous failure
-
varargout=load_gaimc_graph(gr...
LOAD_GAIMC_GRAPH Loads a graph from the gaimc library
-
varargout=mst_prim(A,full,u)
MST_PRIM Compute a minimum spanning tree with Prim's algorithm
-
Contents.m
-
dijkstra_perf.m
-
performance_comparison.m
-
prim_mst_perf.m
-
test_examples.m
-
View all files
gaimc : Graph Algorithms In Matlab Code
by David Gleich
16 May 2009
Efficient pure-Matlab implementations of graph algorithms to complement MatlabBGL's mex functions.
|
Watch this File
|
| File Information |
| Description |
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 |
| Acknowledgements |
The author wishes to acknowledge the following in the creation of this submission:
MatlabBGL
|
| MATLAB release |
MATLAB 7.5 (R2007b)
|
|
Tags for This File
|
| Everyone's Tags |
|
| Tags I've Applied |
|
| Add New Tags |
Please login to tag files.
|
|
Contact us at files@mathworks.com