It is just that i am unable to understand how complexity(time) of bfs/dfs are O(v+e). why not O(v*e)???since most of the times i have seen we just multiply inner loop and outer loop iterations and compute complexity so what is the difference we are having here.
P.S: I have already seen link: http://stackoverflow.com/questions/6850357/explanation-of-runtimes-of-bfs-and-dfs and CLRS but didn't get it.