CapacityScaling::ResidualDijkstra 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::CapacityScaling< Graph, LowerMap, CapacityMap, CostMap, SupplyMap >::ResidualDijkstra

ResidualDijkstra is a special implementation of the Dijkstra algorithm for finding shortest paths in the residual network of the graph with respect to the reduced edge costs and modifying the node potentials according to the distance of the nodes.

Public Member Functions

 ResidualDijkstra (const Graph &graph, const FlowMap &flow, const CapacityEdgeMap &res_cap, const CostMap &cost, const SupplyMap &excess, PotentialMap &potential, PredMap &pred)
 Constructor.
Node run (Node s, Capacity delta=1)
 Runs the algorithm from the given source node.

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

Generated on Sat Apr 19 14:17:22 2008 for LEMON by  doxygen 1.5.5