DFS Analysis
Running time: O(n+e)
call Recursive DFS on each node exactly once (afterwards Encountered is true)
each edge is examined twice (once from each endpoint)
assuming adjacency list representation of graph
Previous slide
Next slide
Back to first slide
View graphic version