Timeline for Dijkstra’s in a graph with negation of edges
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 23, 2019 at 6:30 | comment | added | Meepo | What about an acyclic graph? | |
| Apr 30, 2017 at 23:18 | vote | accept | CommunityBot | ||
| Apr 25, 2017 at 7:46 | comment | added | hengxin | A simpler graph example: $w(S \to A) = 2, w(S \to B) = 1, w(B \to A) = 2$. | |
| Apr 25, 2017 at 2:56 | history | undeleted | nadir | ||
| Apr 25, 2017 at 2:56 | history | edited | nadir | CC BY-SA 3.0 |
added 294 characters in body
|
| Apr 25, 2017 at 2:14 | history | deleted | nadir | via Vote | |
| Apr 25, 2017 at 2:11 | review | First posts | |||
| Apr 25, 2017 at 2:16 | |||||
| Apr 25, 2017 at 2:10 | history | answered | nadir | CC BY-SA 3.0 |