Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

What is the time complexity of the DFS and BFS algorithm? If we consider there are v vertices and e edges in the graph. Thanks

@jiandi_li

O(|V|*max(|V[i].neighbors|))

O(V+E). Each vertex and edge will be accessed at most once.

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.