title: Is the worst time complexity of BFS in a graph traversal n+2E?
body: <p>I  understand that time complexity of BFS in a graph traversal is <code>O( V + E )</code> since every vertex and every edge will be explored in the worst case.</p>
  
  <p>Well,is the exact time complexity <code>v+2E</code> ??</p>
  
  <p>Every vertex is explored once+ Every adjacent vertices</p>
  
  <p>The sum of the degree of all the vertices in a <code>graph= No of edges*2= 2E</code></p>
  
  <p>Thus the time complexity is <code>n+2E</code>..Am i correct? </p>