PathDumper< _Graph > Class Template Reference
[Concepts]

---

Detailed Description

template<typename _Graph>
class lemon::concepts::PathDumper< _Graph >

A skeleton structure for path dumpers. The path dumpers are the generalization of the paths. The path dumpers can enumerate the edges of the path wheter in forward or in backward order. In most time these classes are not used directly rather it used to assign a dumped class to a real path type.

The main purpose of this concept is that the shortest path algorithms can enumerate easily the edges in reverse order. If we would like to give back a real path from these algorithms then we should create a temporarly path object. In Lemon such algorithms gives back a path dumper what can assigned to a real path and the dumpers can be implemented as an adaptor class to the predecessor map.

Parameters:

_Graph

The graph type in which the path is.

The paths can be constructed from any path type by a template constructor or a template assignment operator. #include <lemon/concepts/path.h>

List of all members.

Classes
class	EdgeIt
	Lemon style iterator for path edges. More...
class	RevEdgeIt
	Lemon style iterator for path edges. More...
Public Types
typedef _Graph	Graph
	Type of the underlying graph.
typedef Graph::Edge	Edge
	Edge type of the underlying graph.
typedef False	RevPathTag
	Forward or reverse dumping.
Public Member Functions
int	length () const
	Length of the path ie. the number of edges in the path.
bool	empty () const
	Returns whether the path is empty.

---

Member Typedef Documentation

typedef False RevPathTag

If the RevPathTag is defined and true then reverse dumping is provided in the path dumper. In this case instead of the EdgeIt the RevEdgeIt iterator should be implemented in the dumper.