graph_condensation
Compute strongly connected components of a directed graph and condense them into a DAG using Kosaraju's algorithm. Use it to simplify cyclic graphs for dependency or reachability analysis.
Instructions
Compute SCC condensation of a directed graph into a DAG using Kosaraju's algorithm.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"vertex_count": "<vertex_count>",
"edges": "<edges>"
},
"name": "graph_condensation"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Directed edges as [u, v] pairs (0-indexed) | |
| vertex_count | Yes | Number of vertices |