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>
Additional Inherited Members | |
![]() | |
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. | |
![]() | |
MinCostArborescence (const Digraph &digraph, const CostMap &cost) | |
Constructor. | |
~MinCostArborescence () | |
Destructor. | |
MinCostArborescence & | arborescenceMap (ArborescenceMap &m) |
Sets the arborescence map. | |
MinCostArborescence & | predMap (PredMap &m) |
Sets the predecessor map. | |
const ArborescenceMap & | arborescenceMap () const |
Returns a const reference to the arborescence map. | |
const PredMap & | predMap () const |
Returns a const reference to the pred map. | |
Value | arborescenceCost () const |
bool | arborescence (Arc arc) const |
Returns true if the arc is in the arborescence. | |
Arc | pred (Node node) const |
Returns the predecessor arc of the given node. | |
bool | reached (Node node) const |
bool | processed (Node node) const |
Indicates that a node is processed. | |
int | dualNum () const |
Value | dualValue () const |
Returns the value of the dual solution. | |
Value | dualValue (int k) const |
Returns the value of the dual variable. | |
int | dualSize (int k) const |
void | init () |
void | addSource (Node source) |
Adds a new source node. | |
Node | processNextNode () |
Processes the next node in the priority queue. | |
int | queueSize () const |
Returns the number of the nodes to be processed. | |
bool | emptyQueue () const |
void | start () |
Executes the algorithm. | |
void | run (Node s) |
Runs MinCostArborescence algorithm from node s . | |