Named parameter for setting PredMap type. It must meet the WriteMap concept, and its value type must be the Arc type of the digraph. 
#include <lemon/min_cost_arborescence.h>
 Inheritance diagram for MinCostArborescence< GR, CM, TR >::SetPredMap< T >:
 Inheritance diagram for MinCostArborescence< GR, CM, TR >::SetPredMap< T >:| Additional Inherited Members | |
|  Public Types inherited from MinCostArborescence< Digraph, CostMap, SetPredMapTraits< T > > | |
| typedef SetPredMapTraits< T > | Traits | 
| The traits class of the algorithm. | |
| typedef Traits::Digraph | Digraph | 
| The type of the underlying digraph. | |
| typedef Traits::CostMap | CostMap | 
| The type of the map that stores the arc costs. | |
| typedef Traits::Value | Value | 
| The type of the costs of the arcs. | |
| typedef Traits::PredMap | PredMap | 
| The type of the predecessor map. | |
| typedef Traits::ArborescenceMap | ArborescenceMap | 
| The type of the map that stores which arcs are in the arborescence. | |
|  Public Member Functions inherited from MinCostArborescence< Digraph, CostMap, SetPredMapTraits< T > > | |
| MinCostArborescence (const Digraph &digraph, const CostMap &cost) | |
| Constructor.  More... | |
| ~MinCostArborescence () | |
| Destructor. | |
| MinCostArborescence & | arborescenceMap (ArborescenceMap &m) | 
| Sets the arborescence map.  More... | |
| MinCostArborescence & | predMap (PredMap &m) | 
| Sets the predecessor map.  More... | |
| const ArborescenceMap & | arborescenceMap () const | 
| Returns a const reference to the arborescence map.  More... | |
| const PredMap & | predMap () const | 
| Returns a const reference to the pred map.  More... | |
| Value | arborescenceCost () const | 
| Returns the cost of the arborescence.  More... | |
| bool | arborescence (Arc arc) const | 
| Returns trueif the arc is in the arborescence.  More... | |
| Arc | pred (Node node) const | 
| Returns the predecessor arc of the given node.  More... | |
| bool | reached (Node node) const | 
| Indicates that a node is reachable from the sources.  More... | |
| bool | processed (Node node) const | 
| Indicates that a node is processed.  More... | |
| int | dualNum () const | 
| Returns the number of the dual variables in basis.  More... | |
| Value | dualValue () const | 
| Returns the value of the dual solution.  More... | |
| Value | dualValue (int k) const | 
| Returns the value of the dual variable.  More... | |
| int | dualSize (int k) const | 
| Returns the number of the nodes in the dual variable.  More... | |
| void | init () | 
| Initializes the internal data structures.  More... | |
| void | addSource (Node source) | 
| Adds a new source node.  More... | |
| Node | processNextNode () | 
| Processes the next node in the priority queue.  More... | |
| int | queueSize () const | 
| Returns the number of the nodes to be processed.  More... | |
| bool | emptyQueue () const | 
| Returns falseif there are nodes to be processed.  More... | |
| void | start () | 
| Executes the algorithm.  More... | |
| void | run (Node s) | 
| Runs MinCostArborescence algorithm from node s.  More... | |
 1.8.5
 1.8.5