#include <lemon/concepts/path.h>
_Graph | The graph type in which the path is. |
NodeIt
and EdgeIt
with the same usage. These types converts to the Node
and Edge
of the original graph.
Public Types | |
typedef _Graph | Graph |
Type of the underlying graph. | |
typedef Graph::Edge | Edge |
Edge type of the underlying graph. | |
typedef Graph::Node | Node |
Node type of the underlying graph. | |
Public Member Functions | |
Path (const Graph &_g) | |
int | length () const |
Length of the path ie. the number of edges in the path. | |
bool | empty () const |
Returns whether the path is empty. | |
void | clear () |
Resets the path to an empty path. | |
Node | target () const |
Starting point of the path. | |
Node | source () const |
End point of the path. | |
NodeIt | target (const EdgeIt &) const |
The target of an edge. | |
NodeIt | source (const EdgeIt &) const |
The source of an edge. | |
Classes | |
class | Builder |
Class to build paths. More... | |
class | EdgeIt |
Iterator class to iterate on the edges of the paths. More... | |
class | NodeIt |
Iterator class to iterate on the nodes of the paths. More... |
Node target | ( | ) | const [inline] |
Starting point of the path. Returns INVALID if the path is empty.
Node source | ( | ) | const [inline] |
End point of the path. Returns INVALID if the path is empty.
Returns node iterator pointing to the target node of the given edge iterator.
Returns node iterator pointing to the source node of the given edge iterator.