Reference documentation for deal.II version 9.2.0
|
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) |
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 533 of file sparsity_tools.cc.
void SparsityTools::internal::reorder_hierarchical | ( | const DynamicSparsityPattern & | connectivity, |
std::vector< DynamicSparsityPattern::size_type > & | renumbering | ||
) |
Definition at line 729 of file sparsity_tools.cc.