DagShortestPathWizardBase< _Graph, _LengthMap > Class Template Reference

---

Detailed Description

template<class _Graph, class _LengthMap>
class lemon::DagShortestPathWizardBase< _Graph, _LengthMap >

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

Todo:

More named parameters are required...

#include <lemon/dag_shortest_path.h>

Inheritance diagram for DagShortestPathWizardBase< _Graph, _LengthMap >:

[legend]

List of all members.

Public Member Functions
	DagShortestPathWizardBase ()
	Constructor.
	DagShortestPathWizardBase (const _Graph &graph, const _LengthMap &length, Node source=INVALID)
	Constructor.
Protected Types
typedef Base::Graph::Node	Node
	Type of the nodes in the graph.
Protected Attributes
void *	_graph
	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

DagShortestPathWizardBase

(

)

[inline]

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

DagShortestPathWizardBase	(	const _Graph &	graph,
		const _LengthMap &	length,
		Node	source = INVALID
	)			[inline]

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

Parameters:

	graph	is the initial value of _graph
	length	is the initial value of _length
	source	is the initial value of _source