Graph Search
The same group on the Doxygen site.
- group Graph Search
Common graph search algorithms.
This group contains the common graph search algorithms, namely breadth-first search (BFS) and depth-first search (DFS) [7].
Classes
Class |
Description |
|---|---|
BFS algorithm class. |
|
BFS algorithm class with visitor interface. |
|
DFS algorithm class. |
|
DFS algorithm class with visitor interface. |
|
Maximum Cardinality Search algorithm class. |
Other classes of its headers
Class |
Description |
|---|---|
Default traits class of Bfs class. |
|
Default traits class of bfs() function. |
|
Default traits class used by BfsWizard. |
|
Auxiliary class for the function-type interface of BFS algorithm. |
|
Visitor class for BFS. |
|
Default traits class of BfsVisit class. |
|
Default traits class of Dfs class. |
|
Default traits class of dfs() function. |
|
Default traits class used by DfsWizard. |
|
Auxiliary class for the function-type interface of DFS algorithm. |
|
Visitor class for DFS. |
|
Default traits class of DfsVisit class. |
|
Default traits class of MaxCardinalitySearch class. |
Functions and other members
-
template< class GR >
BfsWizard< BfsWizardBase< GR > > bfs( const GR & digraph ) Function-type interface for BFS algorithm.
This function also has several named parameters, they are declared as the members of class BfsWizard. The following examples show how to use these parameters.
// Compute shortest path from node s to each node bfs( g ).predMap( preds ).distMap( dists ).run( s ); // Compute shortest path from s to t bool reached = bfs( g ).path( p ).dist( d ).run( s , t );
See also
See also
Warning
Don’t forget to put the run() to the end of the parameter list.
-
template< class GR >
DfsWizard< DfsWizardBase< GR > > dfs( const GR & digraph ) Function-type interface for DFS algorithm.
This function also has several named parameters, they are declared as the members of class DfsWizard. The following examples show how to use these parameters.
// Compute the DFS tree dfs( g ).predMap( preds ).distMap( dists ).run( s ); // Compute the DFS path from s to t bool reached = dfs( g ).path( p ).dist( d ).run( s , t );
See also
See also
Warning
Don’t forget to put the run() to the end of the parameter list.