About Borůvka's algorithm
Difference between en1 and en2, changed 4 character(s)
Hello everyone.↵
↵
I just noticed that [CF1648E](https://codeforces.com/problemset/problem/1648/E) has an easier approach , using [Boruvka's algorithm] (https://en.wikipedia.org/wiki/Bor%C5%AFvka%27s_algorithm).↵
↵
Can anyone prove that why the run time of this algorithm is O(ElogV)?↵
↵
Thanks for reading!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English EVENBAO 2022-03-24 09:21:44 4 Tiny change: 'rove that why the run t' -> 'rove that the run t'
en1 English EVENBAO 2022-03-24 09:10:11 332 Initial revision (published)