Is this Prim's MST Source Code is O(E logV) for dense graph? Notes: https://codeforces.com/blog/entry/68133?#comment-524560
№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Is this Prim's MST Source Code is O(E logV) for dense graph? Notes: https://codeforces.com/blog/entry/68133?#comment-524560
Название |
---|
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