NetworkSimplex::BestEligiblePivotRule Class Reference

List of all members.


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.

Public Member Functions

 BestEligiblePivotRule (NetworkSimplex &ns)
 Constructor.
bool findEnteringEdge ()
 Finds the next entering edge.

The documentation for this class was generated from the following file:

Generated on Sat Apr 19 14:21:10 2008 for LEMON by  doxygen 1.5.5