|
Class Summary |
| BCTree |
|
| BiconnectivityAnalyzer |
|
| ConnectivityTest |
This algorithm tests if a graph is connected by running FindAllVerticesDFS
and then counting if the number of vertices visited by DFS is equal to
the total number of vertices in the graph. |
| DFS |
A template method implementation of a depth first search. |
| FindAllVerticesDFS |
This class specializes DFS to return an enumeration of the vertices in
the connected component of the start vertex. |
| FindCycleDFS |
This class specializes DFS to determine if the connected component of
the start vertex contains a cycle and if so return it. |
| FindPathDFS |
This class specializes DFS to determine, given a vertex v, if there is
a path from the start vertex to v in the connected component of the
start vertex. |
| NumConnectedComponents |
This algorithm computes the number of connected components of a
graph using depth-first search. |