-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathECPN_chainred_pol_v2.m
175 lines (147 loc) · 5.71 KB
/
ECPN_chainred_pol_v2.m
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
function P = ECPN_chainred_pol_v2(rel,E,Wpol)
%ECPN_chainred_pol Calculates ECPN for a graph with chain inside
% Detailed explanation goes here
%% assert: no hnodes, not a cycle
n = numel(rel);
Es = sum(E);
ind_ch = (Es == 2);
E_ch = E;
E_ch(~ind_ch,:) = 0;
E_ch(:,~ind_ch) = 0;
%[CompNum comps] = graphconncomp(E_ch,'Directed',false);
[CompNum comps] = graphalgs('wcc',0,false,E_ch); % shortcut, need to place graphalgs MEX-file to the MATLAB path
c_len = zeros(0,CompNum);
for i = 1:CompNum
c_len(i) = nnz(comps == i);
end
c_len(c_len == 1) = 0;
[c_max_len c_max] = max(c_len);
% disp([int2str(nnz(c_len)), ' chain(s) found (max length = ', int2str(c_max_len), '): ', int2str(nonzeros(c_len)')]);
c = find(comps == c_max);
if length(c) > 2
% Es_ch = sum(E_ch);
%c = c(graphtraverse(E(c,c),find(Es_ch(c)==1,1),'Directed',false)); %traversing chain
% c = c(graphalgs('dfs',0,false,E(c,c),find(Es_ch(c)==1,1),inf));% shortcut, need to place graphalgs MEX-file to the MATLAB path
c = c(chaintraverse_fast(E(c,c)));
end
c0 = find(E(c(1),:) & ~E_ch(c(1),:) );
cend = find(E(c(end),:) & ~E_ch(c(end),:));
index = 1:n;
%if c0 == cend
% disp('OLOLO! c0 = cend!');
%end
index([c0 c]) = [];
index = [c0 c index];
cend = find(index == cend);
%c0 = 1;
%reordering nodes, maybe need to avoid this
rel = rel(index);
E = E(index,index);
Wpol = Wpol(index,:);
%if nnz(rel(2:c_max_len+1)) ~= 0
% BGView = biograph(triu(E));
% set(BGView,'ShowArrows','off');%,'LayoutType','equilibrium');
% view(BGView)
% rel
%end
%assert(nnz(rel(2:c_max_len+1)) == 0, '[ERROR] have reliable nodes in the chain!');
%Es = Es(index);
%now we have biggest chain on nodes 2:c_max_len+1
%nodes 1:2 and (c_max_len+1):(c_max_len+2) are adjacent
%need to optimize chain reductions
%mult = prod(V(2:c_max_len+1));
%mult = [1 zeros(1,nnz(~rel(2:c_max_len+1)))];
cum_nonrel = [0,cumsum(~rel(2:end))]; % look into making array shorter
[chainbridge comps_br([1 c_max_len+2:n])] = graphalgs('wcc',0,false,E([1 c_max_len+2:n],[1 c_max_len+2:n])); % shortcut, need to place graphalgs MEX-file to the MATLAB path
%comps_br(2) = 1; % important!
assert(chainbridge < 3, '[ERROR] Assertion failed: Unbelieveable! First node of the chain breaks graph into >2 conn comps!');
assert(comps_br(1) == 1,'[ERROR] Left part of graph has index 2!');
ind1 = (comps_br == 1);
ind2 = (comps_br == 2);
% cnext = [2:c_max_len+1 cend];
if chainbridge == 1
else
end
if ~rel(2) % unfolding loop
ind_q = true(1,n);
ind_q(2)= false;
if chainbridge == 2
ind_q_l = ind1;
ind_q_r = ind2;
ind_q_r(3:c_max_len+1) = true;
tmp = ECPN_C_pol(rel(ind_q_l),E(ind_q_l,ind_q_l),Wpol(ind_q_l,:));
tmp = poly_add(tmp, ECPN_C_pol(rel(ind_q_r),E(ind_q_r,ind_q_r),Wpol(ind_q_r,:)));
% tmp = ECPN_pol(rel(ind_q),E(ind_q,ind_q),Wpol(ind_q,:));
else
tmp = ECPN_C_pol(rel(ind_q),E(ind_q,ind_q),Wpol(ind_q,:));
end
tmp = -[tmp 0] + [0 tmp];
P = [tmp zeros(1,cum_nonrel(1))];
rel(2) = 1;
else
P = 0;
end
Wpol2 = Wpol(2,:);
tmp_p = zeros(1,2*length(Wpol(1,:))-1); % for elimination of poly_add
%now we can reduce resulting reliable node in chain to node 2 in each iteration
for i=3:c_max_len+1 % add one to c_max_len because of the starting node!
if ~rel(i)
%ind_q = [1:i-1 i+1:n];
ind_q = true(1,n);
ind_q(i)= false;
% ind_q(3:i)= false;
%P = P + mult*Q(i) * ECPN(V(ind_q),E(ind_q,ind_q),W(ind_q));
if chainbridge == 2
ind_q_l = ind1;
ind_q_l(2:(i-1)) = true;
ind_q_r = ind2;
ind_q_r((i+1):(c_max_len+1)) = true;
tmp = ECPN_C_pol(rel(ind_q_l),E(ind_q_l,ind_q_l),Wpol(ind_q_l,:));
tmp = poly_add(tmp, ECPN_C_pol(rel(ind_q_r),E(ind_q_r,ind_q_r),Wpol(ind_q_r,:)));
% tmp = ECPN_pol(rel(ind_q),E(ind_q,ind_q),Wpol(ind_q,:));
else
tmp = ECPN_C_pol(rel(ind_q),E(ind_q,ind_q),Wpol(ind_q,:));
end
% tmp = poly_add(tmp, tmp_p);
tmp = -[tmp 0] + [0 tmp];
P = poly_add(P,[tmp zeros(1,cum_nonrel(i-1))]);
rel(i) = 1;
end
% tmp_p = tmp_p + conv2(Wpol(2,:),Wpol(i,:));
tmp_p = tmp_p + conv2(Wpol2,Wpol(i,:));
%P = poly_add(P,[conv2(Wpol(2,:),Wpol(i,:)) zeros(1,cum_nonrel(i-1))]);
Wpol2 = Wpol2 + Wpol(i,:);
% Wpol(2,:) = Wpol(2,:) + Wpol(i,:);
% E(2,cnext(i)) = 1;
% E(cnext(i),2) = 1;
end
%P = P + mult*ECPN_full(W(2:c_max_len+1));
% tmp = ECPN_full_pol(Wpol(2:c_max_len+1,:));
% P = poly_add(P,[tmp zeros(1,cum_nonrel(c_max_len+1))]);
%P = poly_add(P,[tmp_p zeros(1,cum_nonrel(c_max_len+1))]);
%P = poly_add(P,tmp_p);
% Wpol(2,:) = sum(Wpol(2:c_max_len+1,:),1); %!!! CAREFUL !!!
Wpol(2,:) = Wpol2;
assert (cend ~= 2, 'Assertion failed: unbelieveable, cend ~=2 !');
if cend == 1 %c0 == cend
if rel(1)
tmp_p = poly_add(tmp_p,conv(Wpol(1,:),Wpol(2,:)));
else
tmp_p = poly_add(tmp_p,conv([Wpol(1,:) 0],Wpol(2,:)));
end
Wpol(1,:) = Wpol(1,:) + Wpol(2,:);
ind_p = [1 c_max_len+2:n];
else
E(2,cend) = 1; E(cend,2) = 1;
%need to rewrite the algorhitm to enable next line
% E(1,cend) = 1; E(cend,1) = 1; % contracting c0 with cend
ind_p = [1:2 c_max_len+2:n];
end
%P = P + mult*ECPN_C(V(ind_p),E(ind_p,ind_p),W(ind_p));
%tmp = ECPN_C_pol(rel(ind_p),E(ind_p,ind_p),Wpol(ind_p,:));
%P = poly_add(P,[tmp zeros(1,cum_nonrel(c_max_len+1))]);
tmp_p = poly_add(tmp_p,ECPN_C_pol(rel(ind_p),E(ind_p,ind_p),Wpol(ind_p,:)));
P = poly_add(P,[tmp_p zeros(1,cum_nonrel(c_max_len+1))]);
%P = P(find(P,1):end); % trim leading zeros
%P = polytrim_fast(P); % trim leading zeros
end