DijkstraWizard

Declared in lemon/dijkstra.h, in the group Shortest Path Algorithms; the same class on the Doxygen site.

template< class TR >
class DijkstraWizard : public TR

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

This auxiliary class is created to implement the function-type interface of Dijkstra algorithm. It does not have own run() method, it uses the functions and features of the plain Dijkstra.

This class should only be used through the dijkstra() 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 DijkstraWizard()

Constructor.

inline DijkstraWizard( const Digraph & g , const LengthMap & l )

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

Parameters:
  • g – The digraph the algorithm runs on.

  • l – The length map.

inline DijkstraWizard( const TR & b )

Copy constructor.

inline void run( Node s )

Runs Dijkstra algorithm from the given source node.

This method runs Dijkstra algorithm from the given source node 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 the Dijkstra algorithm from node s in order to compute the shortest path to node t (it stops searching when t is processed).

Returns:

true if t is reachable form s.

template< class T >
inline DijkstraWizard< 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 DijkstraWizard< 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 DijkstraWizard< 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 DijkstraWizard< SetPathBase< T > > path( const T & t )

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

inline DijkstraWizard dist( const Value & 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 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 )