Linked from

The 13 pages that link to Topological sorting, each with the reason it gives.

• Directed graphRelated: It turns edge directions into precedence constraints on vertex order.

• Partial orderRelated: It extends precedence constraints represented by a partial order into a usable sequence.

• Partially ordered setRelated: It extends dependency constraints into a sequence compatible with the partial order.

• Depth-first searchRelated: Reverse DFS finish order produces a topological ordering when the graph has no directed cycle.

• Directed acyclic graphRelated: Every directed acyclic graph has such an ordering, which exposes its dependency structure.

• Total orderRelated: It produces a total order extending the graph's partial precedence constraints.

• Adjacency listRelated: Neighbor lists provide the outgoing edges used by common sorting algorithms.

• Strict partial orderRelated: It turns the order's precedence constraints into one compatible sequence.

• Dependency graphRelated: It turns an acyclic dependency graph into a valid execution or build order.

• Antisymmetric relationRelated: A finite partial order, built from an antisymmetric relation, can be extended to such an ordering.

• AntichainRelated: The currently available vertices form an antichain in the induced precedence order.