Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsTopological sorting algorithms

Topological sort

Topological truth

Report a typo

Find one or more true facts about topological ordering among the following ones below:

Select one or more options from the list

The DFS and Kahn's algorithms work in quadratic time, which depends on the number of vertices in the graph

Topological order is a way of sorting vertices in ascending or descending order

A graph can have several possible topological sortings

Strictly one edge comes to each vertex

___

Create a free account to access the full topic