4 ms·
I think you've misunderstood the article. It's talking about the object dependency (pointer) graph, not data structures in a more general sense. The object depe
by putzdown 10y ago
I think you've misunderstood the article. It's talking about the object dependency (pointer) graph, not data structures in a more general sense. The object dependency graph is intrinsically cyclical in the way the OP describes. There's no avoiding it.
- radarsat1 10y agoNo need to be condescending. The article talks duly about the data structure in question and is perfectly interesting. What it doesn't address is when this data structure comes up in practice and whether it can be handled in different ways. In many cases, it might be desirable to search for alternative memory representations, since this data structure obviously complicates things considerably (for C++). For example, a graph is isomorphic to a sparse array, which could avoid embedding bidirectional pointers directly into the graph nodes.