SimplePath
Declared in lemon/path.h, in the group Path Structures; the same class on the Doxygen site.
-
template< typename GR >
class SimplePath A structure for representing directed paths in a digraph.
A structure for representing directed path in a digraph.
In a sense, a path can be treated as a list of arcs. The LEMON path type simply stores 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 a just back insertable and erasable path type. It can be indexed in O(1) time. The back insertion and erasure is amortized O(1) time. This implementation is faster than the
Pathtype because it use just one vector for the arcs.- Template Parameters:
GR – The digraph type in which the path is.
Public Functions
-
inline SimplePath()
Default constructor
-
inline SimplePath( const SimplePath & cpath )
Copy constructor.
-
template< typename CPath >
inline SimplePath( const CPath & cpath ) Template copy constructor.
This path can be initialized with any other path type. It just makes a copy of the given path.
-
inline SimplePath & operator=( const SimplePath & cpath )
Copy assignment.
-
template< typename CPath >
inline SimplePath & operator=( const CPath & cpath ) Template copy assignment.
This path can be initialized with any other path type. It just makes a copy of the given path.
-
inline LemonRangeWrapper1< ArcIt , SimplePath > arcs() const
Gets the collection of the arcs of the path.
This function can be used for iterating on the arcs of the path. It returns a wrapped ArcIt, which looks like an STL container (by having begin() and end()) which you can use in range-based for loops, STL algorithms, etc. For example you can write:
for( auto a : p.arcs() ) doSomething( a );
-
inline int length() const
Length of the path.
-
inline bool empty() const
Return true if the path is empty.
-
inline void clear()
Reset the path to an empty one.
-
inline const Arc & nth( int n ) const
The n-th arc.
Gives back the n-th arc. This function runs in O(1) time.
- Pre:
nis in the range[0..length() - 1].
-
inline const Arc & operator[]( int n ) const
The n-th arc.
Gives back the n-th arc. This operator is just an alias for nth(), it runs in O(1) time.
- Pre:
nis in the range[0..length() - 1].
-
inline void eraseBack()
Erase the last arc of the path.
-
class ArcIt
Iterator class to iterate on the arcs of the paths.
This class is used to iterate on the arcs of the paths
Of course it converts to Digraph::Arc
Public Functions
-
inline ArcIt()
Default constructor.
-
inline ArcIt( const SimplePath & _path )
Initializate the constructor to the first arc of path.
-
inline ArcIt()