Node Dijkstra Versions Save

Added

• avoid option in Graph#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!

• Add browserify.transform option to package.json to allow usage with browserify - Thanks to @kronick

Added

• Pass a deep Map to Graph constructor and a Map to Graph#addNode, thus allowing using numbers as keys for the graph.

Added

• Graph#removeNode Ability to remove a previously set node from the graph, including all it's references

Fixed

• Fixed naming error in README.md documentation
• Improved inline documentation

Added

• Transpiled distribution for usage in the browser

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

The focus of this release is performance.

The algorithm implementation has been rewritten to use more efficient mechanics.

Added

• Graph#path can now accept a cost option and return an object containing the cost of the found path

Deprecated

• Graph#addVertex, use Graph#addNode instead
• Graph#shortestPath, use Graph#path instead

:tada: Now using ES6

Breaking Changes:

• Not compatible with NodeJS
• Use ES6 Classes
• Use const and let
• Use ES6 Map
• Graph#shortestPath is now Graph#path

Improvements

• Validation on the provided objects

Changed

• Updated dependencies to the latest version

Changed

• Updated 101 to latest version