3 Mar
2014
3 Mar
'14
8:49 a.m.
On 2/28/14, 5:58pm, Aaron Windsor wrote:
Yes, pretty much. Even then, you're going to have to do some bookkeeping to keep track of nodes you've already seen on a path and backtrack correctly - e.g., you used nodes a, b, and c on a path from x to y so when you find paths from y to something else you'll have to remove a, b, and c from the graph you explore. And even with nodes of degree 4, you've still got an NP-hard problem and the possibility of an exponential number of paths being output from your algorithm.
Thanks Aaron, I appreciate your advice. I'll be very careful in exploring possible nodes. Cheers!