Timeline for Applying Johnson's algorithm on undirected graph with negative edge weights
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 30, 2017 at 17:05 | history | edited | D.W.♦ | CC BY-SA 3.0 |
added 452 characters in body
|
| Dec 30, 2017 at 11:45 | comment | added | Wuyue Lu |
Thanks for your answer. I am sorry for that I forget to mention an additional constraint for the path: the path should be simple, which means one edge could only be travel for once. And thus the path u-~->a->b->...->a->b-~->v should not be taken into consideration. Is there possibility for us to find simple path from the graph described above by algorithm similar to Johnson?
|
|
| Dec 30, 2017 at 6:43 | history | answered | D.W.♦ | CC BY-SA 3.0 |