BfsWizard

Declared in lemon/bfs.h, in the group Graph Search; the same class on the Doxygen site.

template< class TR >
class BfsWizard : public TR

Auxiliary class for the function-type interface of BFS algorithm.

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.

Public Functions

inline BfsWizard()

Constructor.

inline BfsWizard( const Digraph & g )

Constructor that requires parameters. These parameters will be the default values for the traits class.

Parameters:

g – The digraph the algorithm runs on.

inline BfsWizard( const TR & b )

Copy constructor.

inline void run( Node s )

Runs BFS algorithm from the given source node.

This method runs BFS algorithm from node s in order to compute the shortest path to each node.

inline bool run( Node s , Node t )

Finds the shortest path between s and t.

This method runs BFS algorithm from node s in order to compute the shortest path to node t (it stops searching when t is reached).

Returns:

true if t is reachable form s.

inline void run()

Runs BFS algorithm to visit all nodes in the digraph.

This method runs BFS algorithm in order to visit all nodes in the digraph.

template< class T >
inline BfsWizard< SetPredMapBase< T > > predMap( const T & t )

Named parameter for setting the predecessor map.

Named parameter function for setting the map that stores the predecessor arcs of the nodes.

template< class T >
inline BfsWizard< SetReachedMapBase< T > > reachedMap( const T & t )

Named parameter for setting the reached map.

Named parameter function for setting the map that indicates which nodes are reached.

template< class T >
inline BfsWizard< SetDistMapBase< T > > distMap( const T & t )

Named parameter for setting the distance map.

Named parameter function for setting the map that stores the distances of the nodes calculated by the algorithm.

template< class T >
inline BfsWizard< SetProcessedMapBase< T > > processedMap( const T & t )

Named parameter for setting the processed map.

Named parameter function for setting the map that indicates which nodes are processed.

template< class T >
inline BfsWizard< SetPathBase< T > > path( const T & t )

Named parameter for getting the shortest path to the target node.

inline BfsWizard dist( const int & d )

Named parameter for getting the distance of the target node.

template< class T >
struct SetPredMapBase : public Base

Public Types

typedef T PredMap

Public Functions

inline SetPredMapBase( const TR & b )

Public Static Functions

static inline PredMap * createPredMap( const Digraph & )
template< class T >
struct SetReachedMapBase : public Base

Public Types

typedef T ReachedMap

Public Functions

inline SetReachedMapBase( const TR & b )

Public Static Functions

static inline ReachedMap * createReachedMap( const Digraph & )
template< class T >
struct SetDistMapBase : public Base

Public Types

typedef T DistMap

Public Functions

inline SetDistMapBase( const TR & b )

Public Static Functions

static inline DistMap * createDistMap( const Digraph & )
template< class T >
struct SetProcessedMapBase : public Base

Public Types

typedef T ProcessedMap

Public Functions

inline SetProcessedMapBase( const TR & b )

Public Static Functions

static inline ProcessedMap * createProcessedMap( const Digraph & )
template< class T >
struct SetPathBase : public Base

Public Types

typedef T Path

Public Functions

inline SetPathBase( const TR & b )