Dijkstra — find single-source shortest paths
AllPairsShortestPath — find shortest paths simultaneously for all pairs
ShortestPath — sequence of vertices that define the shortest path
MinimumSpanningTree — find a minimum spanning tree of a graph
NetworkFlow — maximum flow through a graph
ResidualFlowGraph — construct a directed graph for a graph with respect to flow
StableMarriage — optimal stable marriage defined by lists of permutations
MaximalMatching — compute maximal matching of a graph
BipartiteMatching — find a maximum bipartite matching
DepthFirstTraversal — depth-first traversal of a graph
BreadthFirstTraversal — breadth-first traversal of a graph
Isomorphism — find isomorphism between two graphs
Equivalences — vertex equivalence classes between two graphs
