gaimc : Graph Algorithms In Matlab Code: load_test_gaimc_graph - File Exchange

No BSD License

Highlights from
gaimc : Graph Algorithms In Matlab Code

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.

load_test_gaimc_graph

function load_test_gaimc_graph

%%
P1=load('../graphs/kt-7-2.mat');
P2=load_gaimc_graph('kt-7-2.mat');
if ~isequal(P1,P2)
    error('gaimc_graph failed on kt-7-2.mat');
else
    fprintf('gaimc_graph passed load test on kt-7-2.mat\n');
end

%%
P1=load('../graphs/kt-7-2');
P2=load_gaimc_graph('kt-7-2');
if ~isequal(P1,P2)
    error('gaimc_graph failed on kt-7-2');
else
    fprintf('gaimc_graph passed load test on kt-7-2\n');
end

%%
load('../graphs/clr-24-1');
P1 = struct('A',A,'labels',labels,'xy',xy);
load_gaimc_graph('clr-24-1');
P2 = struct('A',A,'labels',labels,'xy',xy);

if ~isequal(P1,P2)
    error('gaimc_graph failed on clr-24-1');
else
    fprintf('gaimc_graph passed load test on clr-24-1\n');
end

Highlights from gaimc : Graph Algorithms In Matlab Code

Highlights from
gaimc : Graph Algorithms In Matlab Code