dijkstrajs
dijkstrajs copied to clipboard
tcort
A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.
i am using it for a scenario where 2 point lead to a single room or 2 entrances of a room i need to compare shortest path for both entrances...
I adopted the priority queue implementation with a min-heap data structure for better performance. I write the code in ES5 for backward compatibility with the previous version and for being...
First off, thank you for making the ground stone library, which is currently in use in famous libraries and utilities. I think that the usage of this library must encourage...
Hello Thomas, first off, thanks for the great library. Your dijkstrajs is working great. Just one question, i'm implementing your library to multi floors pathfinding problem and, unfortunately I do...
Bumps [ansi-regex](https://github.com/chalk/ansi-regex) from 5.0.0 to 5.0.1. Release notes Sourced from ansi-regex's releases. v5.0.1 Fixes (backport of 6.0.1 to v5) This is a backport of the minor ReDos vulnerability in ansi-regex@<6.0.1,...
![dependabot[bot] avatar](https://avatars.githubusercontent.com/in/29110?v=4 "dependabot[bot] avatar"){kind=avatar}
Bumps [minimatch](https://github.com/isaacs/minimatch) from 3.0.4 to 3.0.8. Commits 782c264 3.0.8 6ade2da fix: trim pattern a6f52b0 3.0.7 e4cd434 fix: treat nocase:true as always having magic e6bbe1c publishConfig for 3.0 5b7cd33 3.0.6 20b4b56...
The value of `predecessor` (singular) is seemingly never read, only assigned. https://github.com/tcort/dijkstrajs/blob/b13c58e96c5250701ba3044411ec99b6ae85cc7f/dijkstra.js#L102 from: ``` extract_shortest_path_from_predecessor_list: function(predecessors, d) { var nodes = []; var u = d; var predecessor; while (u)...
