V- the graph vertex type
E- the graph edge type
This implementation can only be used for directed simple graphs. Also for this iterator to work correctly the graph must not be modified during iteration. Currently there are no means to ensure that, nor to fail-fast. The results of such modifications are undefined.
First the shortest paths tree in the edge reversed graph starting at
sink is built. Thus
we get distances $d(v)$ from every vertex $v$ to
sink. We then define a sidetrack edge to
be an edge, which is not in the shortest paths tree. The key observation is that every path
source and the
sink can be solely determined by a sub-sequence of its
edges which are sidetracks.
Let $d(v)$ be the distance from $v$ to
sink and $w()$ be the weight function for edges in
graph. If $e$ connects a pair of vertices $(u, w)$, the $\delta(e)$ is defined as
$w(e)+d(w)-d(u)$. Intuitively, $\delta(e)$ measures how much distance is lost by being
“sidetracked” along $e$ instead of taking a shortest path to
The idea of the algorithm is to build a heap of sidetracks. This heap can be then traversed with
breadth-first search in order to retrieve the implicit representations of the paths between
This implementation has several improvements in comparison to the original description in the article:
|Constructor and Description|
Constructs an instance of the algorithm for the given
|Modifier and Type||Method and Description|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Copyright © 2019. All rights reserved.