Topological Order of a Scenario Graph

Question

## Problem

A Make scenario is a graph of connected modules. Given module dependencies, compute a valid execution order and detect cycles.

## Example
```
A->B->C => run A,B,C; cycle -> invalid
```

## Constraints
- Up to 10^4 modules

## Approach
Kahn's algorithm + cycle detection. Core to executing a visual automation scenario.