I have been a bit distracted with other stuff recently. Also the algorithm I was using in part II doesn't work for complicated paths. One could alway break out Dijkstra's Algorithm, but it seems a bit too terminator like. I want something a bit more fuzzy. Honestly with work I haven't had much of a chance other that to see that something a bit more complicated in order.

Optimism is an occupational hazard of programming: feedback is the treament.
Kent Beck