P39: Enumeration of all topological sortings of a directed acyclic graph

P39: Enumeration of all topological sortings of a directed acyclic graph

Input:

A directed acyclic graph $D$.

Output:

All topological sortings $D$.

Complexity:

$O(1)$ delay per topological sorting.

Comment:

Linear extensions correspond to topological sortings.

Reference:

[Ono2005] (Bibtex)