Context Navigation

Changes between Version 3 and Version 4 of Ticket #181

-                      v3
+                      v4
 init(s);
 }}}
 performing a full Dijkstra, which could be then followed by the of several
+performing a full Dijkstra and computing reduced arc costs, which could be then followed by several
 {{{
 start(t,k);
 }}}
+execution, each of them would call a patrial Dijkstra to ''t'' only ''k-1'' times.
+execution, each of them would reverse the arcs on the shortest ''s-t'' path found by `init(s)` and execute partial Dijkstra to ''t'' only ''k-1'' times.
+It could speed up the use cases when ''k'' arc-disjoint ''s-t'' paths are needed for a lot of ''t'' nodes (e.g. all ''t!=s'' nodes).