SparsityTools::internal Namespace Reference

Functions
DynamicSparsityPattern::size_type	find_unnumbered_starting_index (const std::vector< DynamicSparsityPattern::size_type > &new_indices, const std::vector< std::pair< DynamicSparsityPattern::size_type, DynamicSparsityPattern::size_type > > &rows_by_coordination, std::size_t &next_candidate)
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 std::vector< DynamicSparsityPattern::size_type > &	new_indices,
		const std::vector< std::pair< DynamicSparsityPattern::size_type, DynamicSparsityPattern::size_type > > &	rows_by_coordination,
		std::size_t &	next_candidate
	)

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 ones.

rows_by_coordination holds all rows sorted by coordination number; next_candidate is advanced past already numbered rows.

Definition at line 528 of file sparsity_tools.cc.

reorder_hierarchical()

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

Definition at line 713 of file sparsity_tools.cc.