note
brick
I worked on a vaguely similar problem--nodes-path-ish--and <br>
we ended up making a tree of paths, sorting it depthwise and <br>
breadthwise and then finding an optimized path. You may want <br>
to consider looking at the discrete computing stuff, things <br>
isomorphisms and node graphing. There's a red book with white<br>
webs all over the cover, who's author I can't remember. The <br>
title is something like -Discrete Algorithms-; it was pretty <br>
helpful.<br>
-B.
40586
40586