BFS Analysis
Running time:
every vertex w is enqueued only once (because Encountered(w) is true thereafter) => only dequeued and visited once.
Every edge is looked at twice.
=> total running time is O(n+e)
Previous slide
Next slide
Back to first slide
View graphic version