engineering recuitment GATE CSE 2023-24 Test Series Algorithms Graphs/Spanning Tree and Shortest Paths Graph Search
Consider a graph G(V, E) where V represents vertex and E represents edge of a graph. If topological sorting is implemented on a graph G, time complexity of the above is ______.
1
O(V)
2
O(E)
3
O(V + E)
4
O(1)