allocate_layer_thickness allocate_layer_thickness assemble_graph base_area deposition_time_variable_name deposition_times deposition_times detect_connections east_boundary final_labels first_label flux_out ice_volume IceKind isochrone_depth_variable_name layer_thickness_variable_name n_active_layers N_boot_parameter N_max_parameter non_decreasing north_boundary np pack_data pp prune_deposition_times read_layer_thickness regrid_layer_thickness regridp relabel renormalize resolve_labels south_boundary times_parameter unpack_data west_boundary

resolve_labels() static std::map< int, int > pism::details::resolve_labels ( const std::map< int, std::set< int > > &  graph, bool  mark_isolated_patches  ) static Traverse the graph using a version of the "breadth first search" algorithm and find final labels for all of its nodes. If mark_isolated_patches is true, isolated patches get labeled with 1, the rest with 0. If mark_isolated_patches is false, each connected component in the graph gets a unique label starting from 1 and using consecutive integers. Definition at line 192 of file label_components_parallel.cc. Referenced by final_labels().