MMST is used to create spanning trees in P2P networks while minimizing connections per node
JavaScript
48
3
MIT License
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of rangermauve/mostly-minimal-spanning-tree
browser-side require() the node way
Await the completion or erroring of a stream
Polyfill for Promise.defer. Uses the native ES6 Promise. Supports other Promises/A+ implementations.
Calculate the distance between two buffers as a new buffer and compare computed distances with eachother
A graph processing and visualization library for JavaScript (port of NetworkX for Python).
Good 'ol fashion array randomizing!
Support the repos that depend on this repository
Top contributors
RangerMauve
17 contributions
tinchoz49
5 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet