#include <path.h>
GR | 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.
Definition at line 41 of file skeletons/path.h.
Public Types | |
typedef GR | Graph |
Type of the underlying graph. | |
typedef Graph::Edge | GraphEdge |
Edge type of the underlying graph. | |
typedef Graph::Node | GraphNode |
Node type of the underlying graph. | |
Public Member Functions | |
Path (const Graph &_G) | |
size_t | length () const |
Length of the path. | |
bool | empty () const |
Returns whether the path is empty. | |
void | clear () |
Resets the path to an empty path. | |
GraphNode | head () const |
Starting point of the path. | |
GraphNode | tail () const |
End point of the path. | |
template<typename It> It & | first (It &i) const |
First NodeIt/EdgeIt. | |
NodeIt | head (const EdgeIt &e) const |
The head of an edge. | |
NodeIt | tail (const EdgeIt &e) const |
The tail of an edge. |
|
References Path::Graph. |
|
Starting point of the path. Returns INVALID if the path is empty. Definition at line 69 of file skeletons/path.h. References Path::GraphNode, and lemon::INVALID. |
|
End point of the path. Returns INVALID if the path is empty. Definition at line 74 of file skeletons/path.h. References Path::GraphNode, and lemon::INVALID. |
|
Initializes node or edge iterator to point to the first node or edge. Definition at line 81 of file skeletons/path.h. |
|
Returns node iterator pointing to the head node of the given edge iterator. Definition at line 87 of file skeletons/path.h. References lemon::INVALID. |
|
Returns node iterator pointing to the tail node of the given edge iterator. Definition at line 93 of file skeletons/path.h. References lemon::INVALID. |