2
%TEST13 test cs_counts, cs_etree
8
% Copyright 2006-2007, Timothy A. Davis.
9
% http://www.cise.ufl.edu/research/sparse
17
m = fix (100 * rand (1)) ;
18
n = fix (100 * rand (1)) ;
23
fprintf ('m %4d n %4d nnz(A) %6d nnz(C) %6d\n', m, n, nnz(A), nnz(C)) ;
26
A = A + 1i * sprand (A) ;
29
[p1,po1] = etree (A) ;
31
[p2,po2] = cs_etree (A) ;
32
[p3,po3] = cs_etree (A, 'sym') ;
33
% po2 = cs_post (p2) ;
35
check_if_same (p1,p2) ;
36
check_if_same (po1,po2) ;
38
check_if_same (p1,p3) ;
39
check_if_same (po1,po3) ;
46
check_if_same (c1,c2) ;
48
c2 = cs_counts (triu (A)) ;
49
check_if_same (c1,c2) ;
52
p0 = etree (A, 'col') ;
53
% p1 = etree2 (A, 'col') ; % CHOLMOD
54
p2 = cs_etree (A, 'col') ;
57
check_if_same (p0,p2) ;
60
p0 = etree (C, 'col') ;
61
% p1 = etree2 (C, 'col') ; % CHOLMOD
62
p2 = cs_etree (C, 'col') ;
65
check_if_same (p0,p2) ;
68
% find etree of A'A, and postorder it
69
[m n] = size (A) ; %#ok
72
[cp0 cpo0] = etree (A, 'col') ;
73
% [cp1 cpo1] = etree2 (A, 'col') ; % CHOLMOD
74
[cp2 cpo2] = cs_etree (A, 'col') ;
75
% cpo2 = cs_post (cp2) ;
77
check_if_same (cp0, cp2) ;
78
check_if_same (cpo0, cpo2) ;
80
c0 = symbfact (A, 'col') ;
81
% c1 = symbfact2 (A, 'col') ; % CHOLMOD
82
c2 = cs_counts (A, 'col') ;
84
check_if_same (c0, c2) ;