Pre-topological order
In the field of
linear ordering of its vertices such that if there is a directed path from vertex u to vertex v and v comes before u in the ordering, then there is also a directed path from vertex v to vertex u.[1][2]
If the graph is a
partial order
.
References
- ^ ISBN 9783540443896.
- ^ Sedgewick, Robert; Wayne, Kevin (2016-09-26). "Directed Graphs". Algorithms, 4th Edition. Retrieved 2017-09-06.