albertorestifo/node-dijkstra

A NodeJS implementation of Dijkstra's algorithm

JavaScript

158

MIT License

node-dijkstra is a JavaScript library for NodeJS that provides an efficient implementation of Dijkstra's shortest path algorithm. It allows developers to create graphs, add nodes and edges with associated costs, and find the shortest path between nodes. The library is designed for NodeJS version 4.0.0 or newer and is useful for applications that require pathfinding or network routing capabilities.

Total donated

Undistributed

Share with your subscribers:

Recipients

How the donated funds are distributed

Support the dependencies of albertorestifo/node-dijkstra

babel/babel

Babel compiler core.

babel/babel

ESLint parser that allows for linting of experimental syntax transformed by Babel

browserify/browserify

browser-side require() the node way

import-js/eslint-plugin-import

Import with sanity.

jsx-eslint/eslint-plugin-jsx-a11y

Static AST checker for accessibility rules on JSX elements.

prettier/eslint-plugin-prettier

Runs prettier as an eslint rule

hparra/gulp-rename

Rename files

mochajs/mocha

simple, flexible, fun test framework

moll/js-must

Testing and assertion library with friendly BDD syntax — awesome.must.be.true(). Many expressive matchers and is test runner and framework agnostic. Follows RFC 2119 with its use of MUST. Good and well tested stuff.