Releases: albertorestifo/node-dijkstra
Releases · albertorestifo/node-dijkstra
2.5.0
Added
avoid
option inGraph#path
You can now pass an array of nodes to avoid when computing the path.
Example:
route.path('A', 'D', { avoid: ['C', 'F'] });
Thanks @doesntgolf for the contribution!
2.4.1
2.4.0 - Map as keys
Added
- Pass a deep
Map
toGraph
constructor and aMap
toGraph#addNode
, thus allowing using numbers as keys for the graph.
2.3.0 – Remove a node
Added
Graph#removeNode
Ability to remove a previously set node from the graph, including all it's references
2.2.1 – Mainly docs
Fixed
- Fixed naming error in
README.md
documentation - Improved inline documentation
Added
- Transpiled distribution for usage in the browser
2.2.0 – Back to NodeJS, with v4.0.0
IMPORTANT: The releases from v2.1.1
to v2.1.2
are failing the builds due to code styling issues. They can be considered safe to use.
Changed
- Using NodeJS
v4.0.0
- Updated documentation to mention NodeJS
v4.0.0
2.1.0 – Perfomances
The focus of this release is performance.
The algorithm implementation has been rewritten to use more efficient mechanics.
Added
Graph#path
can now accept acost
option and return an object containing the cost of the found path
Deprecated
Graph#addVertex
, useGraph#addNode
insteadGraph#shortestPath
, useGraph#path
instead
2.0.0
🎉 Now using ES6
Breaking Changes:
- Not compatible with NodeJS
- Use ES6 Classes
- Use
const
andlet
- Use ES6
Map
Graph#shortestPath
is nowGraph#path
Improvements
- Validation on the provided objects
1.1.3
Changed
- Updated dependencies to the latest version
1.1.2
Changed
- Updated
101
to latest version