Computes the strongly connected components of a directed graph
JavaScript
29
5
MIT License
This library computes the strongly connected components of a directed graph using Tarjan's algorithm. It is designed for developers working with graph data structures in JavaScript, particularly those who need to analyze connectivity or decompose graphs into components.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of mikolalysenko/strongly-connected-components
tap-producing test harness for node and browsers
Support the repos that depend on this repository
Top contributors
jaspervdg
7 contributions
mikolalysenko
6 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet
