|
|
researchv10 Dan Cross
C = < 1 2 15 . . . 2 1 3 . . . 3 2 4 11 . . 4 3 5 . . . 5 4 6 7 . . 6 5 8 . . . 7 5 9 30 . . 8 6 9 10 11 . 9 7 8 30 . . 10 8 12 30 31 34 11 3 8 12 13 . 12 10 11 34 36 . 13 11 14 . . . 14 13 15 16 38 . 15 1 14 . . . 16 14 17 20 35 37 17 16 18 . . . 18 17 19 . . . 19 18 20 . . . 20 16 19 21 . . 21 20 22 . . . 22 21 23 . . . 23 22 24 35 . . 24 23 25 39 . . 25 24 . . . . 26 27 33 39 . . 27 26 32 . . . 28 29 32 . . . 29 28 30 . . . 30 7 9 10 29 . 31 10 32 . . . 32 27 28 31 34 . 33 26 34 . . . 34 10 12 32 33 35 35 16 23 34 36 . 36 12 35 38 . . 37 16 38 . . . 38 14 36 37 . . 39 24 26 . . . >; <n, m> = size(C); A = 0*ones(n,n); for i=1:n, for j=2:m, k=c(i,j); if k>0, a(i,k)=1; check = norm(A-A',1), if check > 0, return <X,D> = eig(A+eye); D = diag(D); D = D(n:-1:1) X = X(:,n:-1:1); <x(:,1)/sum(x(:,1)) x(:,2) x(:,3) x(:,19)>
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.