CandidateListPivotRule 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 >::CandidateListPivotRule

This class implements the "Candidate List" pivot rule for the network simplex algorithm.

For more information see NetworkSimplex::run().

List of all members.

Public Member Functions

 CandidateListPivotRule (NetworkSimplex &ns)
 Constructor.
bool findEnteringEdge ()
 Find next entering edge.


Generated on Thu Jun 4 04:06:32 2009 for LEMON by  doxygen 1.5.9