Package annas.graph.util

Class Summary
CycleDetector<N,A extends ArcInterface<N>> Detects cycles in a graph, this classes uses a depth first search to discover cycles.
Dijkstra<N,A extends ArcInterface<N>> Determines a single source-destination shortest path.
Floyd<N,A extends ArcInterface<N>> Determines all pair shortest paths, as described here
Prim<N,A extends ArcInterface<N>> Determines a minimal spanning tree for an Undirected graph, as described here
Tarjan<N,A extends ArcInterface<N>> Tarjan's Algorithm (named for its discoverer, Robert Tarjan) is a graph theory algorithm for finding the strongly connected components of a graph.
Util<N,A extends ArcInterface<N>> Util is a Class containing a group of algorithms for manipulating and extracting data form Graphs.