--- /dev/null
+Changed: The deprecated function SparsityTools::reorder_Cuthill_McKee()
+acting on a SparsityPattern object has been removed.
+Use the one acting on a DynamicSparsityPattern instead.
+<br>
+(Daniel Arndt, 2017/05/15)
std::vector<DynamicSparsityPattern::size_type> &new_indices,
const std::vector<DynamicSparsityPattern::size_type> &starting_indices = std::vector<DynamicSparsityPattern::size_type>());
- /**
- * As above, but taking a SparsityPattern object instead.
- *
- * @deprecated
- */
- void
- reorder_Cuthill_McKee (const SparsityPattern &sparsity,
- std::vector<SparsityPattern::size_type> &new_indices,
- const std::vector<SparsityPattern::size_type> &starting_indices = std::vector<SparsityPattern::size_type>()) DEAL_II_DEPRECATED;
-
/**
* For a given sparsity pattern, compute a re-enumeration of row/column
* indices in a hierarchical way, similar to what
- void
- reorder_Cuthill_McKee (const SparsityPattern &sparsity,
- std::vector<SparsityPattern::size_type> &new_indices,
- const std::vector<SparsityPattern::size_type> &starting_indices)
- {
- DynamicSparsityPattern dsp(sparsity.n_rows(), sparsity.n_cols());
- for (unsigned int row=0; row<sparsity.n_rows(); ++row)
- {
- for (SparsityPattern::iterator it=sparsity.begin(row); it!=sparsity.end(row)
- && it->is_valid_entry() ; ++it)
- dsp.add(row, it->column());
- }
- reorder_Cuthill_McKee(dsp, new_indices, starting_indices);
- }
-
-
-
namespace internal
{
void