| Title: | At last | Finally? |
| Author: | Peter J. Acklam | Peter J. Acklam |
| Submitted: | 2003-11-06 11:09:13 UTC | 2003-11-06 11:11:24 UTC |
| Status: | Failed | Passed |
| Score: | 0.0 | 250.0 |
| Result: | [] | pass |
| CPU Time: | 0.0 | 29.092 |
| Code: |
n = size(a, 1);
s = {1};
D = Inf*(1:n);
P = cell(1,n);
while numel(s)
p = s{end};
s(end)=[];
t = a(p(end),:);
k = setdiff(find(t), p);
for q = k
r = [p q];
s{end+1} = r;
d = 0;
for i = 2:numel(r)
d = d + norm(b(r(i),:) - b(r(i-1),:));
end
if d < D(r(end))
D(r(end)) = d;
P{r(end)} = r;
end
end
end
D(isinf(D))=0;
[i,j]=max(D);
c=P{j};
|
|