Your skill will accomplish what the force of many cannot |
|
PerlMonks |
Re: Six Degrees via Shortest Path ?by jkahn (Friar) |
on Apr 16, 2003 at 20:03 UTC ( [id://251020]=note: print w/replies, xml ) | Need Help?? |
I was inspired to revisit this by a discussion in the chatterbox with gohaku, tye and Enlil. Looks like your second guess was right, Anonymous Monk. I can't for the life of me figure out what's going on in Graph::Traversal, which is the base class for Graph::BFS. The POD reads %param documentation to be written, which is a little disappointing. However, I was able to address the problem you're trying to solve using SSSP_Dijkstra(), which also is a bit short on the POD: This issues a bunch of warnings about Use of uninitialized value in addition (+), which is because of some sloppy code in Graph::Base, but it gets the right answer. (they need the Perl 6 // operator!). Hope that helps!
In Section
Seekers of Perl Wisdom
|
|