Reclaiming C++ Data Structures with Cycles
I recently watched Herb Sutter&#x27;s talk &quot;Leak-Freedom in C++&quot;, described in the article [1], and I can&#x27;t help but notice that C++ community has a strong bias against garbage collection.  ... And then he describes the very problem you can&#x27;t solve without GC: memory management for graphs with cycles.  Solving this problem is equivalent to implementing GC.  Of course, having your own specialized GC may help, but you may also benefit from your own memory allocation.<p>Why can&#x27;t you acknowledge that there are problems that have GC as <i>the only and best</i> solution?<p>(Note: it&#x27;s possible to mix memory management approaches, e.g only pointers to graph nodes are being garbage collected and everything else has a nice hierarchical ownership.)<p>[1] <a href="https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=JfmTagWcqoE" rel="nofollow">https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=JfmTagWcqoE</a>