Re: Graph traversal--shortest path?

A very similar conversation came up in the chatterbox a few weeks ago.

Someone asked about Graph::BFS and linked to Six Degrees via Shortest Path ?. I did some research on this problem, and was able to solve a variant of the problem porkpilot describes by using simple accesses to Graph::Base methods.

In the process of exploring Graph::BFS I found that its biggest problem was its poor documentation -- I couldn't figure out how it worked without reading all the code, and I didn't have the energy.

Comment on Re: Graph traversal--shortest path?

Replies are listed 'Best First'.
Re: Re: Graph traversal--shortest path? by Anonymous Monk on May 06, 2003 at 04:31 UTC
Thanks very much to all for your replies! I appreciate you taking the time. Initially, I searched CPAN for "breadth first" and came up with Graph::BFS (it's at the top of the results ;) ), but until djantzen's suggestions about Graph::Traversal and adjaceny matrices, I could not see how to make it go... While I certainly agree with jkhan about the Graph modules' documentation, the dots are now connected and I have learned a great deal. Now, to go get a copy of Mastering Algorithms with Perl!	[reply]
Re: Re: Re: Graph traversal--shortest path? by porkpilot (Deacon) on May 06, 2003 at 11:59 UTC
Sorry--forgot to check I was logged in for that last post. Anyway, my script is now 100% working and I am adding bells and whistles. ++ to you all and thanks again.	[reply]