Topological sorting is the sorting of vertices of a directed acyclic graph where vertex u appears before vertex v in the final order if there is an edge from u to v. Depending on the graph, there could be multiple orders that honor topological sorting rules

*Clocks and Causality - Ordering Events in Distributed Systems* by Giridhar Manepalli

Josh Beckman