kj: > # connect the nodes > for i in range(len(parts) - 1): > part_i = parts[i] > for j in range(i + 1, len(parts)):
Note that's O(N^2), see the O(sort) standard solution by Mark Dickinson. Bye, bearophile -- http://mail.python.org/mailman/listinfo/python-list
