The QuickGraph.Algorithms.Search namespace contains basic
algorithms, such as the DepthFirstSearchAlgorithm
that are the building blocks other more complex algorithms.
Classes
| Class | Description | |
|---|---|---|
 | BreadthFirstSearchAlgorithm |
Performs a breadth-first traversal
of a directed or undirected graph.
|
| DepthFirstSearchAlgorithm |
The DepthFirstSearchAlgorithm performs a depth-first traversal of the
vertices in a directed graph.
|
| EdgeDepthFirstSearchAlgorithm |
The EdgeDepthFirstSearchAlgorithm performs a depth-first traversal of the
edges in a directed graph.
|
| EdgeHeightFirstSearchAlgorithm |
The EdgeDepthFirstSearchAlgorithm performs a depth-first traversal of the
edges in a directed graph.
|
| HeightFirstSearchAlgorithm | |
| ImplicitDepthFirstSearchAlgorithm | |
| ImplicitEdgeDepthFirstSearchAlgorithm | |
| NeighborBreadthFirstSearch |
Summary description for NeighborBreadthFirstSearch.
|
| NeighborDepthFirstSearchAlgorithm |
The DepthFirstSearchAlgorithm performs a depth-first traversal of the
vertices in a directed graph.
|
| UndirectedDepthFirstSearchAlgorithm |
Performs a undirected (depth first and height first) depth first
search on a directed bidirectional graph.
|
