P345: Enumeration of all topological sortings

P345: Enumeration of all topological sortings

Input:

A graph $G$.

Output:

All topological sortings in $G$.

Complexity:

$O(1)$ amortized time per solution.

Comment:

A topological sorting is also known as a linear extension.

Reference:

[Ruskey1992a] (Bibtex)