top_sort(+ Graph, - Sort0, - Sort)*
Generate the difference list Sort- Sort0 as a topological sorting of graph Graph, if one is possible.
1. prolog::top_sort_3::top_sort/3(int ARG1, int ARG2, int ARG3)():