(parent_child_edge);                                                                  if (deepest_child_edge_it != deepest_child_edge.end()) {                                     // And if we have a child to go on with, we add the length of that path                                     child_record.leaf_path_length += records[find(deepest_child_edge_it->second)].leaf_path_length;                                 }                                                                  // Now we have 