Is this Prim's MST Source Code is O(E logV) for dense graph? Notes: https://codeforces.com/blog/entry/68133?#comment-524560
Is this Prim's MST Source Code is O(E logV) for dense graph? Notes: https://codeforces.com/blog/entry/68133?#comment-524560
| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3650 |
| 2 | Benq | 3582 |
| 3 | Geothermal | 3570 |
| 3 | orzdevinwang | 3570 |
| 5 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3532 |
| 8 | Radewoosh | 3522 |
| 9 | Um_nik | 3483 |
| 10 | jiangly | 3468 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Of course. But, that is guaranteed for Prim's MST algorithm when using a priority queue.
But you can do better by using an array instead in the case of dense graphs.
Which has the better time complexity between above and this
Hint: Express E in terms of V in the worst case.
I am not that great at CP, currently I am beginning at data structures. Please can you explain.
$$$E=O(V^2)$$$ in the worst case