title: The Big O on the Dijkstra Fibonacci-heap solution
body: <p>From <a href="http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm">Wikipedia</a>: <code>O(|E| + |V| log|V|)</code></p>
  
  <p>From <a href="http://bigocheatsheet.com/">Big O Cheat List</a>: <code>O((|V| + |E|) log |V|)</code></p>
  
  <p>I consider there is a difference between <code>E + V log V</code> and <code>(E+V) log V</code>, isn't there?</p>
  
  <p>Because, if Wikipedia's one is correct, shouldn't it be shown as <code>O(|V| log |V|)</code> only then (Removing <code>|E|</code>) for a reason I do not understand?)?</p>
  
  <p>What is the Big O of Dijkstra with Fibonacci-Heap?</p>