DijkstraWizardBase< GR, LM > Class Template Reference

---

Detailed Description

template<class GR, class LM>
class lemon::DijkstraWizardBase< GR, LM >

To make it easier to use Dijkstra algorithm we have created a wizard class. This DijkstraWizard class needs default traits, as well as the Dijkstra class. The DijkstraWizardBase is a class to be the default traits of the DijkstraWizard class.

Todo:

More named parameters are required...

#include <lemon/dijkstra.h>

Inheritance diagram for DijkstraWizardBase< GR, LM >:

[legend]

List of all members.

Public Member Functions
	DijkstraWizardBase ()
	Constructor.
	DijkstraWizardBase (const GR &g, const LM &l, Node s=INVALID)
	Constructor.
Protected Types
typedef Base::Graph::Node	Node
	Type of the nodes in the graph.
Protected Attributes
void *	_g
	Pointer to the underlying graph.
void *	_length
	Pointer to the length map.
void *	_pred
	Pointer to the map of predecessors edges.
void *	_dist
	Pointer to the map of distances.
Node	_source
	Pointer to the source node.

---

Constructor & Destructor Documentation

DijkstraWizardBase

(

)

[inline]

This constructor does not require parameters, therefore it initiates all of the attributes to default values (0, INVALID).

DijkstraWizardBase	(	const GR &	g,
		const LM &	l,
		Node	s = INVALID
	)			[inline]

This constructor requires some parameters, listed in the parameters list. Others are initiated to 0.

Parameters:

	g	is the initial value of _g
	l	is the initial value of _length
	s	is the initial value of _source