Julia : getting whole path from Dijkstra function in Graphs.jl
<p>Is there a possibility to acquire whole path from source vertex to destination vertex using <a href="http://graphsjl-docs.readthedocs.org/en/latest/algorithms.html#dijkstra-s-algorithm" rel="nofollow">Dijkstra algorithm</a> from Graphs.jl module ?</p>

<p>There is a <strong>update_vertex!(visitor, u, v, d)</strong> method invoked when distance to vertex is updated. Is distance updated only when new vertex that belongs to the shortest path is found? I am not really sure.</p>

<p>Thanks.</p>

<p><strong>Edit:</strong></p>

<p>According to documentation there is possibility to reconstruct shortest path using <a href="http://graphsjl-docs.readthedocs.org/en/latest/algorithms.html#floyd-warshall-s-algorithm" rel="nofollow">Floyd-Warshall algorithm</a> with atributes <strong>dists</strong> and <strong>nexts</strong> but I am not sure how. I would like to run it on my <strong>GenericGraph</strong>.</p>

<p>Any idea ?</p>