title: Time Complexity of the Kruskal Algorithm?
body: <p>I am calculating time complexity for kruskal algorithm like this (Please see the algorithm in the Image Attached)</p>
  
  <pre><code>T(n) = O(1) + O(V) + O(E log E) + O(V log V)
       = O(E log E) + O(V log V)
  as |E| &gt;= |V| - 1
  T(n) = E log E + E log E
       = E log E
  </code></pre>
  
  <p>The CLRS Algorithm:</p>
  
  <p><img src="https://i.stack.imgur.com/GCH5j.png" alt="enter image description here"></p>
  
  <p>Is it correct or I'm doing something wrong please tell.</p>