Timeline for Get the running time of forest disjoint sets
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 26, 2013 at 5:42 | vote | accept | omega | ||
| Mar 25, 2013 at 10:29 | history | edited | Raphael |
edited tags
|
|
| Mar 25, 2013 at 7:49 | history | tweeted | twitter.com/#!/StackCompSci/status/316094547455275009 | ||
| Mar 24, 2013 at 23:32 | history | migrated | from stackoverflow.com (revisions) | ||
| Mar 24, 2013 at 21:39 | answer | added | templatetypedef | timeline score: 7 | |
| Mar 24, 2013 at 21:29 | comment | added | gongzhitaao | I think that's an amortized time. cs.utsa.edu/~bylander/cs5633/disjoint-sets.pdf | |
| Mar 24, 2013 at 21:19 | comment | added | omega | I'm still not sure why the height of the tree is log n. | |
| Mar 24, 2013 at 20:52 | comment | added | gongzhitaao | Will this be of some help: en.wikipedia.org/wiki/Disjoint-set_data_structure | |
| Mar 24, 2013 at 20:48 | history | asked | omega | CC BY-SA 3.0 |