template<class TR>
class lemon::BfsWizard< TR >
This auxiliary class is created to implement the function-type interface of Bfs algorithm. It does not have own run() method, it uses the functions and features of the plain Bfs.
This class should only be used through the bfs() function, which makes it easier to use the algorithm.
- Template Parameters
-
TR | The traits class that defines various types used by the algorithm. |
Inherits TR.
|
| BfsWizard () |
| Constructor.
|
|
| BfsWizard (const Digraph &g) |
| Constructor that requires parameters.
|
|
| BfsWizard (const TR &b) |
| Copy constructor.
|
|
void | run (Node s) |
| Runs BFS algorithm from the given source node.
|
|
bool | run (Node s, Node t) |
| Finds the shortest path between s and t .
|
|
void | run () |
| Runs BFS algorithm to visit all nodes in the digraph.
|
|
template<class T > |
BfsWizard< SetPredMapBase< T > > | predMap (const T &t) |
| Named parameter for setting the predecessor map.
|
|
template<class T > |
BfsWizard< SetReachedMapBase< T > > | reachedMap (const T &t) |
| Named parameter for setting the reached map.
|
|
template<class T > |
BfsWizard< SetDistMapBase< T > > | distMap (const T &t) |
| Named parameter for setting the distance map.
|
|
template<class T > |
BfsWizard< SetProcessedMapBase< T > > | processedMap (const T &t) |
| Named parameter for setting the processed map.
|
|
template<class T > |
BfsWizard< SetPathBase< T > > | path (const T &t) |
| Named parameter for getting the shortest path to the target node.
|
|
BfsWizard | dist (const int &d) |
| Named parameter for getting the distance of the target node.
|
|