1
function p = cs_amd (A,order) %#ok
2
%CS_AMD approximate minimum degree ordering.
3
% p = cs_amd(A) finds a minimum degree ordering of A+A'
5
% order = 1: same as cs_amd(A)
6
% order = 2: minimum degree ordering of S'*S where S = A except that
7
% "dense" rows of A are removed from S (a dense row has
8
% 10*sqrt(n) or more entries where n = size(A,2)). Similar
9
% to p = colamd(A), except that colamd does not form A'*A
11
% order = 3: minimum degree ordering of A'*A. Similar to colamd(A,[n m])
12
% where [m n] = size(A), except that colamd does not form A'*A
15
% Prob = UFget ('HB/bcsstk01') ; A = Prob.A ;
18
% nnz (chol (A (p,p)))
20
% See also AMD, COLAMD, SYMAMD.
22
% Copyright 2006, Timothy A. Davis.
23
% http://www.cise.ufl.edu/research/sparse
25
error ('cs_amd mexFunction not found') ;