Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsTopological sorting algorithms

DFS-based topological sort

Dynamic graph

Report a typo

Let's consider an abstract graph with dynamic number of edges and nodes.

Find the proper complexity of graph with $3n$ edges and $4n^2$ vertices, where $n$ is a positive number.

Select one option from the list

O(n)

O(3n)

O(12n^3)

O(n^2)

___

Create a free account to access the full topic