Reference documentation for deal.II version 9.3.0
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
Functions
SparsityTools::internal Namespace Reference

Functions

DynamicSparsityPattern::size_type find_unnumbered_starting_index (const DynamicSparsityPattern &sparsity, const std::vector< DynamicSparsityPattern::size_type > &new_indices)
 
void reorder_hierarchical (const DynamicSparsityPattern &connectivity, std::vector< DynamicSparsityPattern::size_type > &renumbering)
 

Function Documentation

◆ find_unnumbered_starting_index()

DynamicSparsityPattern::size_type SparsityTools::internal::find_unnumbered_starting_index ( const DynamicSparsityPattern sparsity,
const std::vector< DynamicSparsityPattern::size_type > &  new_indices 
)

Given a connectivity graph and a list of indices (where invalid_size_type indicates that a node has not been numbered yet), pick a valid starting index among the as-yet unnumbered one.

Definition at line 532 of file sparsity_tools.cc.

◆ reorder_hierarchical()

void SparsityTools::internal::reorder_hierarchical ( const DynamicSparsityPattern connectivity,
std::vector< DynamicSparsityPattern::size_type > &  renumbering 
)

Definition at line 728 of file sparsity_tools.cc.