topo_count
Count distinct topological orderings of a directed acyclic graph from node count and [from, to] edge pairs to assess valid dependency orders.
Instructions
Count the number of distinct topological orderings of a DAG.
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": {
"num_nodes": "<num_nodes>",
"edges": "<edges>"
},
"name": "topo_count"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Directed edges as [from, to] pairs | |
| num_nodes | Yes | Number of nodes (max 20) |