Anonymous user
Talk:Dijkstra's algorithm: Difference between revisions
→Perl version faulty: new section
(→Perl version faulty: new section) |
|||
Line 371:
return path.length > 0 ? path : null;
}
== Perl version faulty ==
The push_priority() function of the perl implementation is faulty. This can most clearly be seen by adding an edge from 'b' to 'e' of weight 1 making s-b-e the shortest path. Yet this new path is not picked up. The vertices appears to be dequeued from the function in their inserted order, rather than by priority. In the function the binary search comparison appears to be comparing hash addresses.
| |||