rangermauve

rangermauve/mostly-minimal-spanning...

MMST is used to create spanning trees in P2P networks while minimizing connections per node

JavaScript
47
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

Account's avatar
browser-side require() the node way
Account's avatar
Polyfill for Promise.defer. Uses the native ES6 Promise. Supports other Promises/A+ implementations.
Account's avatar
Await the completion or erroring of a stream
Account's avatar
Good 'ol fashion array randomizing!
Account's avatar
Calculate the distance between two buffers as a new buffer and compare computed distances with eachother
Account's avatar
A graph processing and visualization library for JavaScript (port of NetworkX for Python).

Support the repos that depend on this repository

Top contributors

RangerMauve's profile
RangerMauve
17 contributions
tinchoz49's profile
tinchoz49
5 contributions

Recent events

Kivach works on the Obyte network, and therefore you can track all donations.

No events yet