All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
List of all members
CapacityScaling< GR, V, C, TR >::SetHeap< T > Struct Template Reference

Detailed Description

template<typename GR, typename V, typename C, typename TR>
template<typename T>
struct lemon::CapacityScaling< GR, V, C, TR >::SetHeap< T >

Named parameter for setting Heap type, which is used for internal Dijkstra computations. It must conform to the Heap concept, its priority type must be Cost and its cross reference type must be RangeMap<int>.

#include <lemon/capacity_scaling.h>

+ Inheritance diagram for CapacityScaling< GR, V, C, TR >::SetHeap< T >:

Additional Inherited Members

- Public Types inherited from CapacityScaling< GR, V, C, SetHeapTraits< T > >
enum  ProblemType
 Problem type constants for the run() function. More...
 
typedef SetHeapTraits< T >::Digraph Digraph
 The type of the digraph.
 
typedef SetHeapTraits< T >::Value Value
 The type of the flow amounts, capacity bounds and supply values.
 
typedef SetHeapTraits< T >::Cost Cost
 The type of the arc costs.
 
typedef SetHeapTraits< T >::Heap Heap
 The type of the heap used for internal Dijkstra computations.
 
typedef SetHeapTraits< T > Traits
 The traits class of the algorithm.
 
- Public Member Functions inherited from CapacityScaling< GR, V, C, SetHeapTraits< T > >
 CapacityScaling (const GR &graph)
 Constructor.
 
CapacityScalinglowerMap (const LowerMap &map)
 Set the lower bounds on the arcs.
 
CapacityScalingupperMap (const UpperMap &map)
 Set the upper bounds (capacities) on the arcs.
 
CapacityScalingcostMap (const CostMap &map)
 Set the costs of the arcs.
 
CapacityScalingsupplyMap (const SupplyMap &map)
 Set the supply values of the nodes.
 
CapacityScalingstSupply (const Node &s, const Node &t, Value k)
 Set single source and target nodes and a supply value.
 
ProblemType run (int factor=4)
 Run the algorithm.
 
CapacityScalingresetParams ()
 Reset all the parameters that have been given before.
 
CapacityScalingreset ()
 Reset the internal data structures and all the parameters that have been given before.
 
Number totalCost () const
 Return the total cost of the found flow.
 
Value flow (const Arc &a) const
 Return the flow on the given arc.
 
void flowMap (FlowMap &map) const
 Copy the flow values (the primal solution) into the given map.
 
Cost potential (const Node &n) const
 Return the potential (dual value) of the given node.
 
void potentialMap (PotentialMap &map) const
 Copy the potential values (the dual solution) into the given map.
 
- Public Attributes inherited from CapacityScaling< GR, V, C, SetHeapTraits< T > >
const Value INF
 Constant for infinite upper bounds (capacities).