question: private void problemEdgePrep ( ) { for ( int i = 0 ; i < numTreeRoots ; i ++ ) { AbstractBURS_TreeNode n = treeRoots [ i ] ; problemEdgePrep ( n , n . dg_node ) ; } }
target:  Stage 1b: Do bookkeeping to make it easier to identify harmless problem edges.