DirPath::Builder Class Reference
#include <lemon/path.h>
Collaboration diagram for DirPath::Builder:
[legend]List of all members.
Detailed Description
template<typename Graph>
class lemon::DirPath< Graph >::Builder
This class is used to fill a path with edges.
You can push new edges to the front and to the back of the path in arbitrary order then you should commit these changes to the graph.
Fundamentally, for most "Paths" (classes fulfilling the PathConcept) while the builder is active (after the first modifying operation and until the commit()) the original Path is in a "transitional" state (operations on it have undefined result). But in the case of DirPath the original path remains unchanged until the commit. However we don't recomend that you use this feature.
Definition at line 270 of file path.h.
Constructor & Destructor Documentation
|
- Parameters:
-
| _P | the path you want to fill in. |
Definition at line 277 of file path.h. |
Member Function Documentation
void setStartNode |
( |
const GraphNode & |
|
) |
[inline] |
|
|
Sets the starting node of the path. Edge added to the path afterwards have to be incident to this node. It should be called if and only if the path is empty and before any call to pushFront() or pushBack()
Definition at line 286 of file path.h. |
void pushFront |
( |
const GraphEdge & |
e |
) |
[inline] |
|
void pushBack |
( |
const GraphEdge & |
e |
) |
[inline] |
|
void reserveFront |
( |
size_t |
r |
) |
[inline] |
|
|
If you know a reasonable upper bound of the number of the edges to add to the front, using this function you can speed up the building.
Definition at line 323 of file path.h. |
void reserveBack |
( |
size_t |
r |
) |
[inline] |
|
|
If you know a reasonable upper bound of the number of the edges to add to the back, using this function you can speed up the building.
Definition at line 330 of file path.h. |
The documentation for this class was generated from the following file:
Generated on Mon Feb 21 15:02:35 2005 for LEMON by
1.4.1