get_face_connectivity_of_cells (const Triangulation<dim, spacedim> &triangulation,
DynamicSparsityPattern &connectivity);
- /**
- * As above, but filling a SparsityPattern object instead.
- *
- * @deprecated
- */
- template <int dim, int spacedim>
- void
- get_face_connectivity_of_cells (const Triangulation<dim, spacedim> &triangulation,
- SparsityPattern &connectivity) DEAL_II_DEPRECATED;
-
/**
* Produce a sparsity pattern in which nonzero entries indicate that two
* cells are connected via a common vertex. The diagonal entries of the
- template <int dim, int spacedim>
- void
- get_face_connectivity_of_cells (const Triangulation<dim,spacedim> &triangulation,
- SparsityPattern &cell_connectivity)
- {
- DynamicSparsityPattern dsp;
- get_face_connectivity_of_cells(triangulation, dsp);
- cell_connectivity.copy_from(dsp);
- }
-
-
-
template <int dim, int spacedim>
void
get_vertex_connectivity_of_cells (const Triangulation<dim,spacedim> &triangulation,
// passing this graph off to METIS.
// finally defer to the other function for
// partitioning and assigning subdomain ids
- SparsityPattern cell_connectivity;
+ DynamicSparsityPattern cell_connectivity;
get_face_connectivity_of_cells (triangulation, cell_connectivity);
+ SparsityPattern sp_cell_connectivity;
+ sp_cell_connectivity.copy_from(cell_connectivity);
partition_triangulation (n_partitions,
- cell_connectivity,
+ sp_cell_connectivity,
triangulation);
}
(const Triangulation<deal_II_dimension, deal_II_space_dimension> &triangulation,
DynamicSparsityPattern &cell_connectivity);
- template
- void get_face_connectivity_of_cells
- (const Triangulation<deal_II_dimension, deal_II_space_dimension> &triangulation,
- SparsityPattern &cell_connectivity);
-
template
void get_vertex_connectivity_of_cells
(const Triangulation<deal_II_dimension, deal_II_space_dimension> &triangulation,