Talk:Dijkstra's algorithm: Difference between revisions

Content added Content deleted

Inline

Revision as of 16:41, 28 November 2016 (view source) rosettacode>Healyp (→‎Perl version faulty: new section) ← Older edit		Revision as of 09:24, 29 November 2016 (view source) Trizen (talk \| contribs) m (→‎Perl version faulty: fixed) Newer edit →
Line 375:		Line 375:

	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.		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.

			:Fixed. [[User:Trizen\|Trizen]] ([[User talk:Trizen\|talk]])