jkstra

jkstra copied to clipboard

Have you considered switching out from your own priority queue implementation to a Fibonacci Heap implementation? FH has one of the best amortized runtimes for Dijkstra implementations. The [mnemonist](https://www.npmjs.com/package/mnemonist) library...

sfwhite

add a developing section to help people get started

1

Also fixes a deprecation warning in mocha

jamiecook

- [x] A\* (by just adding a simple heuristic function parameter to Dijkstra?) - [x] Bidirectionnal Dijkstra (and A*) - [ ] Dijkstra on edges (a la PG Routing Shooting...

bbecquet

bbecquet

Example: - matrix based - shared adjacency list instead of lists by node - efficient storage for undirected graphs

bbecquet

bbecquet