Timeline for Why can't we find shortest paths with negative weights by just adding a constant so that all weights are positive?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 20, 2017 at 8:15 | answer | added | Pendechosen | timeline score: 0 | |
| Jan 21, 2016 at 11:20 | comment | added | D.W.♦ | We do have a question that already explains this, but it got marked as a dup of another question that is pretty confusing and hard to understand, and that mixes multiple different questions together. Therefore, I think this question has value over what we had before. If you wanted, I suppose we could re-target the dups (close them as a dup of this instead off what they currently point to). | |
| Jan 21, 2016 at 0:50 | history | tweeted | twitter.com/StackCompSci/status/689973228824064006 | ||
| Jan 20, 2016 at 22:33 | comment | added | Mr.Me | @Raphael I'm sorry since I couldn't phrase my question in a specific format I couldn't search for it. | |
| Jan 20, 2016 at 21:30 | comment | added | David Richerby | @Raphael I'm pretty sure it's a dupe, too, but I figured it'd be faster to answer it than find the dupe. | |
| Jan 20, 2016 at 21:13 | vote | accept | Mr.Me | ||
| Jan 20, 2016 at 19:19 | comment | added | Raphael | Have you tried proving your claim or finding a counter-example? Hint: your intuition is wrong. (Community, I'm pretty sure this is a duplicate. Can you find it?) | |
| Jan 20, 2016 at 19:19 | history | edited | Raphael | CC BY-SA 3.0 |
edited tags
|
| Jan 20, 2016 at 18:49 | answer | added | David Richerby | timeline score: 25 | |
| Jan 20, 2016 at 17:16 | review | First posts | |||
| Jan 20, 2016 at 18:55 | |||||
| Jan 20, 2016 at 17:14 | history | asked | Mr.Me | CC BY-SA 3.0 |