Are you sure you're getting this? Fill in the missing part by typing it in.
In graph theory, topological sorting is the _ ordering of the vertices of a directed acyclic graph (DAG) such that for every directed edge (u, v), vertex u comes before vertex v in the ordering. A topological ordering is possible if and only if the graph has no directed cycles. Topological sorting has many applications, especially in scheduling problems, dependency analysis, and task ordering.
Write the missing line below.
