The Dijkstra Shortest Path algorithm always produces the best solution, i.e. the shortest path between the source and the destination vertices. The path computed by the Dijkstra algorithm is highlighted in red; the solutions produced by the genetic algorithms are compared to Dijkstra's result in order to evaluate how close to best possible solution they are.
Dominik Zindel
2007-07-04
