Timeline for What data structure could I use for modeling a network of nodes and edges?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 10, 2012 at 14:11 | vote | accept | Mark Taylor | ||
| Feb 10, 2012 at 8:47 | history | tweeted | twitter.com/#!/StackProgrammer/status/167892388721860608 | ||
| Feb 10, 2012 at 8:24 | answer | added | Gere | timeline score: 1 | |
| Feb 10, 2012 at 7:30 | answer | added | Spoike | timeline score: 5 | |
| S Feb 10, 2012 at 5:44 | history | suggested | PersonalNexus | CC BY-SA 3.0 | fixed formatting, minor language tweaks, made title a question |
| Feb 10, 2012 at 5:43 | review | Suggested edits | |||
| S Feb 10, 2012 at 5:44 | |||||
| Feb 10, 2012 at 0:28 | comment | added | S.Lott | Node-Edge graph structures are notoriously hard to model well because either nodes or edges are sufficient. Having both is redundant. Yet. Some queries are better with nodes and some queries are better with edges. There is no pat answer. There is, however, "a ton of academic and practical data". But there can never be a pat answer. | |
| Feb 9, 2012 at 23:25 | comment | added | Patrick Hughes | Sounds like a fairly standard graph data structure. Boost has a graph along with algorithms to match, and there's a ton of academic and practical data on working with graphs out there. | |
| Feb 9, 2012 at 23:02 | history | asked | Mark Taylor | CC BY-SA 3.0 |