topo_count
Read-onlyIdempotent
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.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Directed edges as [from, to] pairs | |
| num_nodes | Yes | Number of nodes (max 20) |