Hi everyone,
I want to compute the mean distance in a Jgrapht graph. So, I have to
compute distances for each possible pairs in the graph. But computing
Dijsktra for each pairs is taking too much time. I heard that
Dijkstra didnt give you only the shortest path between the source node
and the target node but also between the source and all nodes in the
graph at the same time. is it the case in the current implementation of
dijkstra in Jgraht? If yes, how can I retrieve this list of distances.
Thanks for your help.
--
Sincerely,
Julien THOMAS DE BOER
Swiss Federal Institute of Technology of Lausanne (EPFL)
|