SparseSolverUtilities.GetReverseCuthillMcKeeOrdering<T> Method

public static int[] GetReverseCuthillMcKeeOrdering<T>(
	SparseMatrix<T> matrix
)

Public Shared Function GetReverseCuthillMcKeeOrdering(Of T) ( 
	matrix As SparseMatrix(Of T)
) As Integer()

public:
generic<typename T>
static array<int>^ GetReverseCuthillMcKeeOrdering(
	SparseMatrix<T>^ matrix
)

static member GetReverseCuthillMcKeeOrdering : 
        matrix : SparseMatrix<'T> -> int[] 

Parameters

matrix  SparseMatrix<T>

A square sparse matrix.

Type Parameters

T

The matrix scalar type.

Return Value

The graph uses the union of logical off-diagonal nonzeros in the matrix and its transpose. Each component starts at the lowest-degree unvisited vertex, breaking ties by original index. Breadth-first neighbors are ordered by degree and then index; the complete traversal is reversed. Isolated vertices are included. The source is not modified.

The result can be passed directly to the ordering argument of incomplete-factor preconditioners. This bandwidth/profile heuristic does not guarantee reduced bandwidth or fill.

Reference