

%
% check dijkstra for only positive values
%
% write graph xml reader
%
% add graph struct type...
%
% ctrl-c mex files
% 
% 
%

% graph constructions
% - butterfly graph [A xy labels] = butterfly_graph(levels)
% - cycle graph [A xy] = cycle_graph(nodes)
% - complete graph [A xy] = complete_graph(nodes)
% - hypercube graph A = hypercube_graph(nodes)
% - grid graph A = hypergrid_graph(n1,n2,...)
% - generalized petersen graph
% - random subgraph
% - k-ary tree
% - graph_product
% - line_graph
% - circulant graph (generalization of complete graph)
% - wheel graph
% - degree sequence

% graph algorithms
% - greedy vertex cover
% - eulerian tour
% - prufer code (to/from tree)
% - degree sequence

% graph embeddigns
% - circular embedding
% - ranked embedding

% data structures
% - incidence matrix
% - symmetrize graph (aka. make_undirected)

fprintf('Wanna help?  Send me email!');

