Tour
About Us
Meta
Loading…
Log in
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Stack Exchange
All Sites
Top Users
Digests
Sandy
top
accounts
reputation
activity
bookmarks
subscriptions
Top Questions
16
votes
Why is time complexity for BFS/DFS not simply O(E) instead of O(E+V)?
graph
time-complexity
depth-first-search
breadth-first-search
asked Nov 5 '14 at 5:29
stackoverflow.com
Top Answers
No answers with score of 5 or more
Stack Exchange works best with JavaScript enabled
stackoverflow.com