Reordered edge and node deletion in digraph destructor to avoid segfaults in complex class hierarchies due to inherited classes holding on to edge pointers too long.

Author: THOMAS S. MANNER

src/digraph.cpp

@@ -23,8 +23,10 @@ DiGraph::~DiGraph() {
 
 
 void DiGraph::clear() {
-  while (mEdges.size()) delete *mEdges.begin();
+  // Delete nodes first since they will likely delete their edges
   while (mNodes.size()) delete *mNodes.begin();
+  // Just in case, delete any orphaned edges
+  while (mEdges.size()) delete *mEdges.begin();
 }