prolog::top_sort/2¶
top_sort(+ Graph, - Sort)*
Generate the set of nodes Sort as a topological sorting of graph Graph, if one is possible. In the next example we show how topological sorting works for a linear graph:
?- top_sort([_138-[_219],_219-[_139], _139-[]],L).
L = [_138,_219,_139]