Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

DijkstraWizard Class Template Reference
[Path and Flow Algorithms]

#include <lemon/dijkstra.h>

List of all members.


Detailed Description

template<class TR>
class lemon::DijkstraWizard< TR >

This class is created to make it easier to use Dijkstra algorithm. It uses the functions and features of the plain Dijkstra, but it is much simpler to use it.

Simplicity means that the way to change the types defined in the traits class is based on functions that returns the new class and not on templatable built-in classes. When using the plain Dijkstra the new class with the modified type comes from the original class by using the :: operator. In the case of DijkstraWizard only a function have to be called and it will return the needed class.

It does not have own run method. When its run method is called it initiates a plain Dijkstra class, and calls the Dijkstra::run method of it.

Definition at line 791 of file dijkstra.h.

Public Member Functions

 DijkstraWizard ()
 Constructor.
 DijkstraWizard (const Graph &g, const LengthMap &l, Node s=INVALID)
 Constructor that requires parameters.
 DijkstraWizard (const TR &b)
 Copy constructor.
void run ()
 Runs Dijkstra algorithm from a given node.
void run (Node s)
 Runs Dijkstra algorithm from the given node.
template<class T>
DijkstraWizard< DefPredMapBase<
T > > 
predMap (const T &t)
 Named parameter function for setting PredMap type
template<class T>
DijkstraWizard< DefPredNodeMapBase<
T > > 
predNodeMap (const T &t)
 Named parameter function for setting PredNodeMap type
template<class T>
DijkstraWizard< DefDistMapBase<
T > > 
distMap (const T &t)
 Named parameter function for setting DistMap type
DijkstraWizard< TR > & source (Node s)
 Sets the source node, from which the Dijkstra algorithm runs.


Constructor & Destructor Documentation

DijkstraWizard const Graph &  g,
const LengthMap &  l,
Node  s = INVALID
[inline]
 

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

Definition at line 829 of file dijkstra.h.


Member Function Documentation

void run  )  [inline]
 

Runs Dijkstra algorithm from a given node. The node can be given by the source function.

Definition at line 841 of file dijkstra.h.

Here is the call graph for this function:

void run Node  s  )  [inline]
 

Runs Dijkstra algorithm from the given node.

Parameters:
s is the given source.

Definition at line 855 of file dijkstra.h.

Here is the call graph for this function:

DijkstraWizard<DefPredMapBase<T> > predMap const T &  t  )  [inline]
 

Named parameter function for setting PredMap type

Definition at line 875 of file dijkstra.h.

DijkstraWizard<DefPredNodeMapBase<T> > predNodeMap const T &  t  )  [inline]
 

Named parameter function for setting PredNodeMap type

Definition at line 896 of file dijkstra.h.

DijkstraWizard<DefDistMapBase<T> > distMap const T &  t  )  [inline]
 

Named parameter function for setting DistMap type

Definition at line 916 of file dijkstra.h.

DijkstraWizard<TR>& source Node  s  )  [inline]
 

Sets the source node, from which the Dijkstra algorithm runs.

Parameters:
s is the source node.

Definition at line 926 of file dijkstra.h.

Here is the call graph for this function:


The documentation for this class was generated from the following file:
Generated on Sat Mar 19 10:58:49 2005 for LEMON by  doxygen 1.4.1