The main purpose of this concept is that the shortest path algorithms can enumerate the arcs easily in reverse order. In LEMON, such algorithms give back a (reverse) path dumper that can be assigned to a real path. The dumpers can be implemented as an adaptor class to the predecessor map.
| GR | The digraph type in which the path is. |
#include <lemon/concepts/path.h>
Classes | |
| class | ArcIt |
| LEMON style iterator for enumerating the arcs of a path. More... | |
| class | RevArcIt |
| LEMON style iterator for enumerating the arcs of a path in reverse direction. More... | |
Public Types | |
| typedef GR | Digraph |
| Type of the underlying digraph. | |
| typedef Digraph::Arc | Arc |
| Arc type of the underlying digraph. | |
| typedef False | RevPathTag |
| Forward or reverse dumping. | |
Public Member Functions | |
| int | length () const |
| Length of the path, i.e. the number of arcs on the path. | |
| bool | empty () const |
| Returns whether the path is empty. | |
| typedef False RevPathTag |