Timeline for Word-Ladder solver in Python 3
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2019 at 12:01 | history | tweeted | twitter.com/StackCodeReview/status/1139865400340955136 | ||
| Jun 14, 2019 at 15:07 | vote | accept | Alex F | ||
| Jun 14, 2019 at 13:28 | history | became hot network question | |||
| Jun 14, 2019 at 12:11 | answer | added | 301_Moved_Permanently | timeline score: 5 | |
| Jun 14, 2019 at 8:41 | answer | added | AlexV | timeline score: 6 | |
| Jun 14, 2019 at 7:26 | history | edited | jonrsharpe | CC BY-SA 4.0 |
deleted 110 characters in body; added 1 character in body
|
| Jun 14, 2019 at 6:08 | comment | added | Alex F | I mean, the answer to the side question was just "no"... I just didn't have a good enough understanding of the term "tree" so the question didn't make much sense. | |
| Jun 14, 2019 at 5:50 | comment | added | dfhwze | Feel free to post a self-answer to enlighten us :) | |
| Jun 14, 2019 at 5:39 | comment | added | Alex F | Never mind - I just found the answer to my confusingly worded question. Apologies. | |
| Jun 14, 2019 at 5:32 | comment | added | dfhwze | Side answer: A node that knows both the parent and children is double-linked: en.wikipedia.org/wiki/Doubly_linked_list. So a node that knows only one is just 'linked'. Since a tree has a parent-child cardinality of 1..*, it would always be the child that knows the parent when 'linked'. | |
| Jun 14, 2019 at 5:29 | history | edited | dfhwze | CC BY-SA 4.0 |
tag
|
| Jun 14, 2019 at 5:26 | history | asked | Alex F | CC BY-SA 4.0 |