Named parameter for setting FlowMap type.
#include <lemon/suurballe.h>
Inheritance diagram for Suurballe< GR, LEN, TR >::SetFlowMap< T >:Additional Inherited Members | |
Public Types inherited from Suurballe< GR, LEN, SetFlowMapTraits< T > > | |
|
typedef SetFlowMapTraits< T > ::Digraph | Digraph |
| The type of the digraph. | |
|
typedef SetFlowMapTraits< T > ::LengthMap | LengthMap |
| The type of the length map. | |
|
typedef SetFlowMapTraits< T > ::Length | Length |
| The type of the lengths. | |
|
typedef SetFlowMapTraits< T > ::FlowMap | FlowMap |
| The type of the flow map. | |
|
typedef SetFlowMapTraits< T > ::PotentialMap | PotentialMap |
| The type of the potential map. | |
| typedef SetFlowMapTraits< T >::Path | Path |
| The type of the path structures. | |
|
typedef SetFlowMapTraits< T > ::HeapCrossRef | HeapCrossRef |
| The cross reference type used for the heap. | |
| typedef SetFlowMapTraits< T >::Heap | Heap |
| The heap type used for internal Dijkstra computations. | |
| typedef SetFlowMapTraits< T > | Traits |
| The traits class of the algorithm. | |
Public Member Functions inherited from Suurballe< GR, LEN, SetFlowMapTraits< T > > | |
| Suurballe (const Digraph &graph, const LengthMap &length) | |
| Constructor. More... | |
| ~Suurballe () | |
| Destructor. | |
| Suurballe & | flowMap (FlowMap &map) |
| Set the flow map. More... | |
| Suurballe & | potentialMap (PotentialMap &map) |
| Set the potential map. More... | |
| const FlowMap & | flowMap () const |
| Return a const reference to an arc map storing the found flow. More... | |
| const PotentialMap & | potentialMap () const |
| Return a const reference to a node map storing the found potentials (the dual solution). More... | |
| Length | totalLength () const |
| Return the total length of the found paths. More... | |
| int | flow (const Arc &arc) const |
| Return the flow value on the given arc. More... | |
| Length | potential (const Node &node) const |
| Return the potential of the given node. More... | |
| int | pathNum () const |
| Return the number of the found paths. More... | |
| const Path & | path (int i) const |
| Return a const reference to the specified path. More... | |
| int | run (const Node &s, const Node &t, int k=2) |
| Run the algorithm. More... | |
| void | init (const Node &s) |
| Initialize the algorithm. More... | |
| void | fullInit (const Node &s) |
| Initialize the algorithm and perform Dijkstra. More... | |
| int | start (const Node &t, int k=2) |
| Execute the algorithm. More... | |
| int | findFlow (const Node &t, int k=2) |
| Execute the algorithm to find an optimal flow. More... | |
| void | findPaths () |
| Compute the paths from the flow. More... | |
1.8.5