| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | adamant | 163 |
| 3 | awoo | 161 |
| 4 | nor | 152 |
| 5 | maroonrk | 151 |
| 5 | -is-this-fft- | 151 |
| 7 | TheScrasse | 148 |
| 8 | atcoder_official | 146 |
| 9 | Petr | 145 |
| 10 | pajenegod | 144 |
Need Help! IN CSES Graph Series in Shortest Route 2 problem it is accepting solution of floyd warshall algorithm while O(n*2logn) not (using dijkastra Priority queue).
#
I want to know , when It is benificial to use floyd warshall algorithm and when not ?
If $$$O(n^3)$$$ is allowed then it is very short to code floyd warshall. Also, floyd warshall works with negative edges too.
You can check this problem, which uses the idea used in floyd warshall.
Floyd-warshall finds the shortest path from all $$$i$$$ to $$$j$$$ in which internal nodes $$$\in (1, 2, \cdots, k)$$$. Here $$$i, j, k$$$ has the same meaning as described here
But in the question , it is given there is no negative weights. Thats why I am using priority queue. Thank you for suggestion and problem.