node-dijkstra

node-dijkstra copied to clipboard

Find all shortest paths

4

Is it possible to return all shortest paths in the case that there is more than one path with the same (minimal) cost?

retorquere

Limitation on cost 0

3

Looking at the function isValidNode I see that a cost of 0 is forbidden. ```js function isValidNode(val) { const cost = Number(val); if (isNaN(cost) || cost

atanarro

Bidirectional paths?

1

`{ A: { B: 5, D: 5, E: 7 },B: { C: 4 },C: { D: 8, E: 2 },D: { C: 8, E: 6 },E: { B: 3 }...

ghost

Are there any benchmark tests for this?

1

I am looking to run this algorithm on one million nodes (A1.....An) repeatedly doing route.path('A1'...'K') So only the starting node changes, whereas the ending node will stay the same. In...

decentralisedkev

Bumps [js-yaml](https://github.com/nodeca/js-yaml) from 3.14.1 to 3.14.2. Changelog Sourced from js-yaml's changelog. [3.14.2] - 2025-11-15 Security Backported v4.1.1 fix to v3 [4.1.1] - 2025-11-12 Security Fix prototype pollution issue in yaml...

dependabot[bot]

feat: enhance pathfinding options with maxCost, maxNodes, and allowedCallback

2

This pull request adds new constraints and customization options to the `Graph` class's `path()` method, enhancing its flexibility for pathfinding. It introduces support for limiting the maximum cost and maximum...

123FLO321

Rewrite codebase in TypeScript for v3.0.0 - Clean types with documented interfaces and strict ESLint rules

8

TypeScript Migration Complete - node-dijkstra v3.0.0 ## Successfully Completed ✅ - [x] Set up TypeScript tooling and configuration - [x] Update package.json for TypeScript support and v3.0.0 - [x] Convert...

Copilot

Max Cost option

1

It would be usefull, if `path` allowed setting maxCost as option. When searching for a path that might not exist in large graphs, specifying a max cost would ensure that...

123FLO321