Enumerates ALL valid topological orderings. Output is deterministic (frontier sorted
by NodeId at each step). Only practical for small graphs (n ≤ ~8).
Type alias for a value function over node coalitions.
The library guarantees the coalition slice is sorted in ascending NodeId order before calling,
so callers may use it as a stable cache key.