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
from
gaimc : Graph Algorithms In Matlab Code
by David Gleich
Efficient pure-Matlab implementations of graph algorithms to complement MatlabBGL's mex functions.
|
| varargout=load_gaimc_graph(graphname) |
function varargout=load_gaimc_graph(graphname)
% LOAD_GAIMC_GRAPH Loads a graph from the gaimc library
%
% load_gaimc_graph is a helper function to load a graph provided with the
% library regardless of the current working directory.
%
% If it's called without any output arguments, it functions just like a
% load command executed on the .mat file with the graph. If it's called
% with an output arguemnt, it functions just like a load command with
% output arguments. It's somewhat complicated to explain because this is
% just a convinence function to make the examples work for any path, and
% not just from the gaimc root directory.
%
% Example:
% % equivalent to load('graphs/airports.mat') run from the gaimc directory
% load_gaimc_graph('airports')
% % equivalent to P=load('graphs/kt-7-2.mat') run from the gaimc directory
% P=load_gaimc_graph('kt-7-2.mat')
% % so you don't have to put the path in for examples!
% David F. Gleich
% Copyright, Stanford University, 2008-2009
% History
% 2009-04-27: Initial coding
path=fileparts(mfilename('fullpath'));
if nargout==0
evalin('caller',['load(''' fullfile(path,'graphs',graphname) ''');']);
else
P = load(fullfile(path,'graphs',graphname));
varargout{1} = P;
end
|
|
Contact us at files@mathworks.com