ResidualDijkstra Class Reference

---

Detailed Description

template<typename Graph, typename LengthMap = typename Graph::template EdgeMap<int>>
class lemon::Suurballe< Graph, LengthMap >::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 lengths and modifying the node potentials according to the distance of the nodes.

List of all members.

Public Member Functions
	ResidualDijkstra (const Graph &graph, const FlowMap &flow, const LengthMap &length, PotentialMap &potential, PredMap &pred, Node s, Node t)
	Constructor.
bool	run ()
	Runs the algorithm. Returns true if a path is found from the source node to the target node.