@rtsao/scc
Find strongly connected components of a directed graph using [Tarjan's algorithm](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm).
Activity
- Latest release
- 4y ago
- Total releases
- 2
- Cadence
- ~3.0 years
- Last 12 months
- 0
Reach
- Stars
- —
Details
- License
- MIT
- First release
- Apr 15, 2019
Releases
| Version | Released | |
|---|---|---|
1.1.0
minor
| ||
1.0.0
initial
|