Explore relationships

Topological ordering

In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge (u,v) from vertex u to vertex v, u comes before v in the ordering.

Use + to expand a branch. Click a topic name to open its summary.