A structure for representing directed path in a digraph.
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 in the path and the source node of a zero length path is undefined.
This implementation is completly static, i.e. it can be copy constucted or copy assigned from another path, but otherwise it cannot be modified.
Being the the most memory efficient path type in LEMON, it is intented to be used when you want to store a large number of paths.
#include <lemon/path.h>
Classes | |
class | ArcIt |
Iterator class to iterate on the arcs of the paths. More... | |
Public Member Functions | |
StaticPath () | |
Default constructor. More... | |
StaticPath (const StaticPath &cpath) | |
Copy constructor. | |
template<typename CPath > | |
StaticPath (const CPath &cpath) | |
Template copy constructor. More... | |
~StaticPath () | |
Destructor of the path. More... | |
StaticPath & | operator= (const StaticPath &cpath) |
Copy assignment. | |
template<typename CPath > | |
StaticPath & | operator= (const CPath &cpath) |
Template copy assignment. More... | |
const Arc & | nth (int n) const |
The n-th arc. More... | |
ArcIt | nthIt (int n) const |
The arc iterator pointing to the n-th arc. | |
int | length () const |
The length of the path. | |
int | empty () const |
Return true when the path is empty. | |
void | clear () |
Erase all arcs in the digraph. | |
const Arc & | front () const |
The first arc of the path. | |
const Arc & | back () const |
The last arc of the path. | |
|
inline |
Default constructor
|
inline |
This path can be initialized from any other path type.
|
inline |
Destructor of the path
|
inline |
This path can be made equal to any other path type. It simply makes a copy of the given path.
|
inline |
n
is in the [0..length() - 1]
range.