Timeline for What do shortest-path algorithms actually calculate?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 25, 2021 at 12:52 | vote | accept | Manfred Weis | ||
| May 25, 2021 at 5:23 | answer | added | usul | timeline score: 3 | |
| May 24, 2021 at 18:46 | comment | added | RobPratt | Search phrase: "elementary shortest path" | |
| May 24, 2021 at 17:53 | comment | added | aorq | If you have a graph $G$ with $n$ vertices and you assign a weight of $-1$ to each edge, the shortest true path from $u$ to $v$ has weight $-(n-1)$ if and only if there is a Hamiltonian path from $u$ to $v$. Thus your second question is a Millennium Prize Problem! ☺️ | |
| May 24, 2021 at 17:01 | history | asked | Manfred Weis | CC BY-SA 4.0 |