69 ::
post(home,xv,off)));
72 ::
post(home,xv,off)));
91 if ((y.
size() != n) || (c.
size() != n*n))
96 for (
int i=0;
i<offset;
i++)
98 for (
int i=n;
i--; ) {
99 for (
int j=0; j<n; j++)
100 cx[offset+j] = c[
i*n+j];
116 if (home.
failed())
return;
118 circuit(home, c, offset, x, y, z, icl);
136 if (home.
failed())
return;
148 ::
post(home,xv,no)));
151 ::
post(home,xv,no)));
156 for (
int i=offset; i--; )
159 ox[offset + i] = x[i];
160 element(home, ox, e, offset+n);
165 ::
post(home,xv,off)));
168 ::
post(home,xv,off)));
175 path(home,0,x,s,e,icl);
189 if ((y.
size() != n) || (c.
size() != n*n))
191 if (home.
failed())
return;
192 path(home, offset, x, s, e, icl);
194 for (
int i=0;
i<offset;
i++)
197 for (
int i=n;
i--; ) {
198 for (
int j=0; j<n; j++)
199 cx[offset+j] = c[
i*n+j];
209 path(home,c,0,x,s,e,y,z,icl);
216 if (home.
failed())
return;
218 path(home, c, offset, x, s, e, y, z, icl);
224 path(home,c,0,x,s,e,z,icl);