See: Description
| Class | Description |
|---|---|
| BreadthFirstSearch<T extends BfsVertex> |
Implementation of breadth-first search following
CLRS, pp.
|
| DepthFirstSearch<T extends DfsVertex> |
This is the most basic implementation of depth-first search.
|
| EdgeTypeDepthFirstSearch<E extends EdgeTypeData,V extends EdgeTypeDfsVertex<E>> |
This implementation of depth-first search specifies the type
of each edge as it is explored.
|
| OrderedDepthFirstSearch<T extends OrderedDfsVertex> |
This class guarantees that the vertices will always
be searched in a specific order.
|
| StronglyConnectedComponents<T extends DfsVertex & ComponentVertex,U extends OrderedDfsVertex> |
Identify the strongly connected components in a graph using an int value
to mark the component to which each vertex belongs.
|
| TopologicalSort<T extends ColoredVertex> |
Assuming that there is no cycle in the graph, this algorithm creates
a linked list representing an ordering that respects the edges in the graph.
|