how to reduce the weight of edge such that shortest distance between starting node and all nodes remains same as previous
is it by dijkstra's algorithm or something else??
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
dijkstra's algorithm
how to reduce the weight of edge such that shortest distance between starting node and all nodes remains same as previous
is it by dijkstra's algorithm or something else??
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 | ashishranjan2828 | 2017-01-19 12:39:36 | 194 | Initial revision (published) |
Name |
---|