<br><br><div><span class="gmail_quote">On 7/18/07, <b class="gmail_sendername">Tim Newsom</b> <<a href="mailto:cephdon@gmail.com">cephdon@gmail.com</a>> wrote:</span><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
<br><snip><br>You could expand this a little and possibly select items from multiple<br>location lists and then select<br>"Find the shortest route to complete all tasks" <br></blockquote><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
<snip><br>--Tim<br><br>_______________________________________________<br>OpenMoko community mailing list<br><a href="mailto:community@lists.openmoko.org">community@lists.openmoko.org</a><br><a href="http://lists.openmoko.org/mailman/listinfo/community">
http://lists.openmoko.org/mailman/listinfo/community</a><br></blockquote></div><br>just don't expect it to do so very fast... and make sure it runs as a REALLY low priority<br><br><a href="http://en.wikipedia.org/wiki/Traveling_salesman_problem">
http://en.wikipedia.org/wiki/Traveling_salesman_problem</a><br><a href="http://en.wikipedia.org/wiki/NP-hard">http://en.wikipedia.org/wiki/NP-hard</a><br clear="all"><br>-- <br>Jeff<br>O|||||||O