| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 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 |
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) |
