                         } else if(records[find(parent_deepest_child_it->second)].leaf_path_length < record.leaf_path_length) {                             // We are longer than what's there now                              #ifdef debug                             cerr << "\t\tWe are our parent's new deepest child!" << endl; #endif                                                          // Demote what's there to second-best                             parent_record.second_deepest_child_edge = parent_deepest_child_it->second;                             parent_record.has_second_deepest_child = true;                              #ifdef debug                             cerr << "\t\t\t