Crafty Carrot

[l,c] = maxpath(0, [1], A, d);

function [maxl, maxtrail] = maxpath(l, trail, A, d)
  curr = trail(length(trail));
  ind = find(A(curr,:));
  ind(find(ind==curr))=[];
  ind(find( intersect(ind,trail) ) ) = [];
  maxl = l;
  maxtrail = trail;
  for i = ind
    [newl, newtrail] = maxpath(l+ norm(d(curr,:) - d(i,:)), [trail i], A, d);
    if newl > maxl
      maxtrail = [newtrail];
      maxl = newl;
    end
  end



[q,w] = maxpath(0, [1], A, d);