Comments on: Implementation of Dijkstra’s Single-Source Shortest-Paths in JavaScript http://wyattbaldwin.com/2008/08/19/implementation-of-dijkstras-single-source-shortest-paths-in-javascript/ Tue, 17 Nov 2009 13:46:32 +0000 hourly 1 http://wordpress.org/?v=3.0 By: Peter Bodo http://wyattbaldwin.com/2008/08/19/implementation-of-dijkstras-single-source-shortest-paths-in-javascript/comment-page-1/#comment-7406 Peter Bodo Tue, 17 Nov 2009 13:46:32 +0000 http://wyattbaldwin.com/?p=223#comment-7406 Mystery is solved: I needed to add "return" within the sorter function... FF was smarter, for sure :) Mystery is solved: I needed to add “return” within the sorter function…
FF was smarter, for sure :)

]]> By: Peter Bodo http://wyattbaldwin.com/2008/08/19/implementation-of-dijkstras-single-source-shortest-paths-in-javascript/comment-page-1/#comment-7404 Peter Bodo Tue, 17 Nov 2009 13:20:26 +0000 http://wyattbaldwin.com/?p=223#comment-7404 Hi Wyatt! Thanks for the excellent script. I am also applying it to a bike route planner in Budapest, and in normal browsers it works really fine, however in IE8 it throws the following error, which I could not solve. Üzenet: A várt elem szám (number expected) Sor: 58 Karakter: 7 Kód: 0 URI: dijkstra.js This is the line: key = keys.sort(sorter)[0]; I hope you will have some ideas, because I am getting mad :) Thanks again for the nice work. Cheers, Peter Hi Wyatt!

Thanks for the excellent script. I am also applying it to a bike route planner in Budapest, and in normal browsers it works really fine, however in IE8 it throws the following error, which I could not solve.

Üzenet: A várt elem szám (number expected)
Sor: 58
Karakter: 7
Kód: 0
URI: dijkstra.js

This is the line:
key = keys.sort(sorter)[0];

I hope you will have some ideas, because I am getting mad :)

Thanks again for the nice work.
Cheers,
Peter

]]> By: Chris Huntley http://wyattbaldwin.com/2008/08/19/implementation-of-dijkstras-single-source-shortest-paths-in-javascript/comment-page-1/#comment-677 Chris Huntley Sun, 24 Aug 2008 04:48:19 +0000 http://wyattbaldwin.com/?p=223#comment-677 If performance becomes an issue you may want to replace your generic sort routine (qsort?) with a d-heap. It's been 15 years since I last coded a heap from scratch, but I recall that even in C binary heaps aren't too bad to implement and O(1) insertions are pretty darn near impossible to beat, especially for building up big search trees one node at a time like A* does. If performance becomes an issue you may want to replace your generic sort routine (qsort?) with a d-heap. It’s been 15 years since I last coded a heap from scratch, but I recall that even in C binary heaps aren’t too bad to implement and O(1) insertions are pretty darn near impossible to beat, especially for building up big search trees one node at a time like A* does.

]]>