t
% directory lies.  

%% Search algorithms
% The two standard graph search algorithms are depth first search and 
% breadth first search.  This library implements both.

%%
% Load the example matrix from the Boost Graph Library 
load_gaimc_graph('dfs_example');
figure(1); graph_draw(A,xy,'labels',labels);

%%
% Run a depth first search.  The output records the distance to the other
% vertices, except where the vertices are not reachable starting from the
% first node A.
d=dfs(A,1)

%%
% From this example, 