This is an npm package that implements the Floyd-Warshall algorithm for finding shortest paths in weighted graphs with both positive and negative edge weights (but no negative cycles). It's designed for JavaScript developers working on graph algorithms or network analysis who need to calculate shortest paths between all pairs of nodes in a graph.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of mljs/floyd-warshall
Matrix manipulation and computation library
This plugin transforms ES2015 modules to CommonJS
Babel preset for TypeScript.
TypeScript definitions for jest
Shared ESLint config for TypeScript projects
Delightful JavaScript Testing.
A deep deletion module for node (like `rm -rf`)
TypeScript is a language for application scale JavaScript development
Support the repos that depend on this repository
Top contributors
lpatiny
11 contributions
maasencioh
8 contributions
mljs-bot
5 contributions
targos
2 contributions
stropitek
1 contributions
EscapedGibbon
1 contributions
olegpetroveth
1 contributions
jobo322
1 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet