Timeline for How to find the shortest path with wormhole nodes?
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 10, 2017 at 10:59 | history | protected | gnat | ||
| Oct 10, 2017 at 1:34 | comment | added | Geeky I | The "correct" way to model the distances would be to use topology and model this as a higher dimensional surface. I wonder if such an answer would be appropriate here? | |
| Oct 9, 2017 at 23:40 | history | tweeted | twitter.com/StackSoftEng/status/917535332651937792 | ||
| Oct 9, 2017 at 21:42 | answer | added | Rene | timeline score: 0 | |
| Oct 9, 2017 at 14:48 | answer | added | MT0 | timeline score: 5 | |
| Oct 9, 2017 at 14:37 | history | edited | JimmyJames | CC BY-SA 3.0 | fixed image formatting |
| Oct 9, 2017 at 11:42 | vote | accept | Jeff smith | ||
| Oct 9, 2017 at 11:24 | history | edited | Jeff smith | CC BY-SA 3.0 | added 1 character in body |
| Oct 9, 2017 at 11:22 | comment | added | Jeff smith | Oops, messed up, thanks guys! @DanielJour and Blue | |
| Oct 9, 2017 at 11:13 | comment | added | Daniel Jour | Blue is actually 12 (7+3+2) moves, no? | |
| Oct 9, 2017 at 11:10 | comment | added | BlueRaja - Danny Pflughoeft | Shouldn't the blue path be 12 (including the two to get from the last purple to the red)? | |
| Oct 9, 2017 at 11:05 | answer | added | amon | timeline score: 49 | |
| Oct 9, 2017 at 10:52 | history | edited | Jeff smith | CC BY-SA 3.0 | edited title |
| Oct 9, 2017 at 10:47 | review | First posts | |||
| Oct 10, 2017 at 11:02 | |||||
| Oct 9, 2017 at 10:47 | history | asked | Jeff smith | CC BY-SA 3.0 |