|Pathologically Eclectic Rubbish Lister|
traversing a hash looking for path?by Anonymous Monk
|on Apr 11, 2006 at 19:10 UTC||Need Help??|
Anonymous Monk has asked for the
wisdom of the Perl Monks concerning the following question:
I'm wondering if anyone has some suggestions on how to accomplish this. I have a data structure mocked up below that represents connections between two nodes. I'm trying to create an algorithm that given a starting and ending IP will find one path. This is a lot like the traveling salesman problem. The data structure is simply a representaion of the data so I can alter it in any way that might make this problem easier.
I could always just use brute force, but there has to be a more elegant solution.