| # | 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 |
About shortest path/negative cycle on Bellman ford algorithm
The algorithm computes from one source vertex the whole thing.
If i want to detect negative cycles in a graph using bellman ford, if i assume vertex 1 as the source, and no edge comes out of the vertex 1 in that test set, it wont work.
how will you consider source vertex in these cases... to detect negative cycles
Asking for solutions..
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
sayeed_1999 | 2020-09-16 15:43:12 | 230 | ||
| en3 |
|
sayeed_1999 | 2020-09-16 15:27:29 | 6 | Tiny change: 'ont work\nasking for ' -> 'ont work\n\n\nAsking for ' | |
| en2 |
|
sayeed_1999 | 2020-09-16 15:26:31 | 72 | ||
| en1 |
|
sayeed_1999 | 2020-09-16 15:25:17 | 348 | Initial revision (published) |
