Skip to main content
Software Engineering

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

2
  • 4
    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. Commented Feb 9, 2012 at 23:25
  • 2
    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. Commented Feb 10, 2012 at 0:28