http://wyattbaldwin.com/2008/08/19/implementation-of-dijkstras-single-source-shortest-paths-in-javascript/ Deep Water Tue, 06 Jan 2009 03:59:48 +0000 http://wordpress.org/?v=2.7 hourly 1 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.

]]>