BestEligiblePivotRule Class Reference
Detailed Description
template<typename Graph, typename LowerMap = typename Graph::template EdgeMap<int>, typename CapacityMap = typename Graph::template EdgeMap<int>, typename CostMap = typename Graph::template EdgeMap<int>, typename SupplyMap = typename Graph::template NodeMap<int>>
class lemon::NetworkSimplex< Graph, LowerMap, CapacityMap, CostMap, SupplyMap >::BestEligiblePivotRule
This class implements the "Best Eligible" pivot rule for the
network simplex algorithm.
For more information see NetworkSimplex::run().
List of all members.