tarjan_scc
Finds all strongly connected components in a directed graph using Tarjan's algorithm, helping you identify cyclic groups from a list of edges.
Instructions
Find all strongly connected components of a directed graph using Tarjan's algorithm.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Array of directed edges |