template<typename GR>
class lemon::Path< GR >
A structure for representing directed path in a digraph.
- Template Parameters
-
GR | The digraph type in which the path is. |
In a sense, the path can be treated as a list of arcs. The LEMON path type stores just this list. As a consequence, it cannot enumerate the nodes of the path and the source node of a zero length path is undefined.
This implementation is a back and front insertable and erasable path type. It can be indexed in O(1) time. The front and back insertion and erase is done in O(1) (amortized) time. The implementation uses two vectors for storing the front and back insertions.
|
| Path () |
| Default constructor. More...
|
|
| Path (const Path &cpath) |
| Copy constructor.
|
|
template<typename CPath > |
| Path (const CPath &cpath) |
| Template copy constructor. More...
|
|
Path & | operator= (const Path &cpath) |
| Copy assignment.
|
|
template<typename CPath > |
Path & | operator= (const CPath &cpath) |
| Template copy assignment. More...
|
|
int | length () const |
| Length of the path.
|
|
bool | empty () const |
| Return whether the path is empty.
|
|
void | clear () |
| Reset the path to an empty one.
|
|
const Arc & | nth (int n) const |
| The n-th arc. More...
|
|
ArcIt | nthIt (int n) const |
| Initialize arc iterator to point to the n-th arc. More...
|
|
const Arc & | front () const |
| The first arc of the path.
|
|
void | addFront (const Arc &arc) |
| Add a new arc before the current path.
|
|
void | eraseFront () |
| Erase the first arc of the path.
|
|
const Arc & | back () const |
| The last arc of the path.
|
|
void | addBack (const Arc &arc) |
| Add a new arc behind the current path.
|
|
void | eraseBack () |
| Erase the last arc of the path.
|
|