Timeline for Efficiently or Elegantly construct linear graph list from vertex pairs
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 20, 2015 at 23:01 | vote | accept | Manuel --Moe-- G | ||
| Feb 20, 2015 at 22:54 | comment | added | Manuel --Moe-- G | @Mr.Wizard Yes, and the ordering is significant. | |
| Feb 20, 2015 at 21:23 | answer | added | Zviovich | timeline score: 2 | |
| Feb 20, 2015 at 21:10 | answer | added | Mr.Wizard | timeline score: 2 | |
| Feb 20, 2015 at 20:51 | comment | added | Mr.Wizard | I only meant what you wrote. So you want to find all of the connected components of Graph[chainParts]? | |
| Feb 20, 2015 at 20:36 | comment | added | Manuel --Moe-- G | @Mr.Wizard or do you mean the sample data? | |
| Feb 20, 2015 at 20:36 | comment | added | Manuel --Moe-- G | 4) pairs that are not "ready" to be part of an append get queued for the next pass, or the next, etc | |
| Feb 20, 2015 at 20:33 | comment | added | Manuel --Moe-- G | 1) find heads in pairs that cannot be another's tail 2) pair by pair, use Position to find correct list 3) append to that list | |
| Feb 20, 2015 at 20:30 | comment | added | Mr.Wizard | Would you mind describing in plain English the logic for how these "chains" are built? | |
| Feb 20, 2015 at 20:18 | history | edited | Manuel --Moe-- G | CC BY-SA 3.0 | added 69 characters in body |
| Feb 20, 2015 at 20:00 | history | asked | Manuel --Moe-- G | CC BY-SA 3.0 |