Finish 2003-11-13 10:00:00 UTC

probably not the shortest

by Christopher Cheng

Status: Passed
Results: pass
CPU Time: 7.38
Score: 194.0
Submitted at: 2003-11-06 11:19:18 UTC
Scored at: 2003-11-06 11:53:24 UTC

Comments
Please login or create a profile.
Code
w=(b(:,1)+1)*inf;
p={1};
q=1;
while q
    r={};
    s=[];
    for i=find(q)
        y=p{i};
        z=y(end);
        g=q(i);
        if g<w(z)
            w(z)=g;
            f{z}=y;
        end
        for j=find(a(z,:))
            if ~any(j==y)
                r=[r {[y j]}];
                s=[s g+norm(b(z,:)-b(j,:))];
            end
        end
    end
    p=r;
    q=s;
end
[i j]=max(w);
c=f{j};