Timeline for Random spanning tree of a rectangular grid
Current License: CC BY-SA 4.0
26 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 29, 2021 at 9:56 | history | edited | alephalpha |
edited tags
|
|
| S Apr 1, 2020 at 9:43 | history | bounty ended | xnor | ||
| S Apr 1, 2020 at 9:43 | history | notice removed | xnor | ||
| S Mar 25, 2020 at 4:11 | history | bounty started | xnor | ||
| S Mar 25, 2020 at 4:11 | history | notice added | xnor | Reward existing answer | |
| Mar 22, 2020 at 6:31 | answer | added | Bubbler | timeline score: 9 | |
| Jan 4, 2020 at 0:28 | answer | added | Nick Kennedy | timeline score: 1 | |
| Jan 2, 2020 at 8:56 | answer | added | xnor | timeline score: 3 | |
| Dec 31, 2019 at 18:00 | history | tweeted | twitter.com/StackCodeGolf/status/1212071013137231872 | ||
| Dec 31, 2019 at 5:25 | comment | added | Bubbler | @LuisMendo I have no problem with such a solution (though the challenge was indeed inspired from the "minimum random spanning tree" Wikipedia article). | |
| Dec 31, 2019 at 5:14 | comment | added | Bubbler | @Neil Yes, it's fine. | |
| Dec 31, 2019 at 3:06 | answer | added | alephalpha | timeline score: 8 | |
| Dec 31, 2019 at 1:06 | comment | added | Neil | Is it acceptable for my ASCII grid to bordered by whitespace on all sides? | |
| Dec 31, 2019 at 0:41 | comment | added | Wheat Wizard♦ | The randomness part of the challenge seems needlessly tacked on to a perfectly fine challenge. | |
| Dec 30, 2019 at 22:44 | answer | added | John Dvorak | timeline score: 4 | |
| Dec 30, 2019 at 21:57 | answer | added | Neil | timeline score: 1 | |
| Dec 30, 2019 at 21:24 | answer | added | Arnauld | timeline score: 1 | |
| Dec 30, 2019 at 19:30 | answer | added | Nick Kennedy | timeline score: 3 | |
| Dec 30, 2019 at 17:38 | comment | added | FlipTack | @LuisMendo I was about to go write an algorithm doing exactly like that to make a point... BogoSpanningTree | |
| Dec 30, 2019 at 15:17 | history | became hot network question | |||
| Dec 30, 2019 at 13:21 | comment | added | Luis Mendo | As the challenge stands now, I could generate graphs randomly, check if the current graph is a spanning tree, else repeat. The program will have random running time (usually very large), but will finish with probability 1. You may want to rule that out (not sure how). Or is that acceptable? | |
| Dec 30, 2019 at 9:42 | answer | added | ngn | timeline score: 2 | |
| Dec 30, 2019 at 8:12 | comment | added | Bubbler | @ValueInk Yes, it's allowed. | |
| Dec 30, 2019 at 8:00 | comment | added | Value Ink | See my answer; are complex number coordinates to distinguish vertices allowed? | |
| Dec 30, 2019 at 7:59 | answer | added | Value Ink | timeline score: 2 | |
| Dec 30, 2019 at 7:15 | history | asked | Bubbler | CC BY-SA 4.0 |