I have a question regarding some of the parameters necessary to run Dijkstra's algorithm from the Lemon Graph Libraries (Lemon's Dijkstra's http://lemon.cs.elte.hu/pub/tutorial/a00009.html).
To run the algorithm, one would write something like dijkstra(g, length).distMap(dist).run(s,t);
where g
is the graph, s
is that starting node and t
is the destination node. My question is what is length
and dist
, and how are they used.
Thanks!
Using Dijkstra's Algorithm with the Lemon Graph Library
2.1k views Asked by Qman At
1
The way I read it, they both need to be maps, one to edge lengths (input) one to vertex distances(output),
Also check lgf_demo.cc and dijkstra_test.cc and note
so this is your output of Dijstra.