A skeleton structure for representing directed paths 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 zero length paths cannot store the source.
#include <lemon/concepts/path.h>
Classes | |
| class | ArcIt |
| LEMON style iterator for path arcs. More... | |
Public Types | |
| typedef GR | Digraph |
| Type of the underlying digraph. | |
| typedef Digraph::Arc | Arc |
| Arc type of the underlying digraph. | |
Public Member Functions | |
| Path () | |
| Default constructor. | |
| template<typename CPath > | |
| Path (const CPath &cpath) | |
| Template constructor. | |
| template<typename CPath > | |
| Path & | operator= (const CPath &cpath) |
| Template assigment. | |
| int | length () const |
| Length of the path ie. the number of arcs in the path. | |
| bool | empty () const |
| Returns whether the path is empty. | |
| void | clear () |
| Resets the path to an empty path. | |
1.8.2