Computer scienceAlgorithms and data structuresAlgorithmsGraph algorithmsTopological sorting algorithms

Topological sort

Definition

Report a typo

For a directed acyclic graph $G = (V, E)$ , a topological sorting is the order of nodes $V$ such that ...

Select one option from the list

... for each

(u, v) \in E

the node

u

comes before the node

v

... each pair of neighbours

u, v

is connected by an edge.

... for each

(u, v) \in E

the node

v

comes before the node

u

... each pair of neighbours

u, v

comes in the alphabetic order.

Create a free account to access the full topic