Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

Re: Graph traversal--shortest path?

by jkahn (Friar)
on May 05, 2003 at 19:41 UTC ( #255732=note: print w/replies, xml ) Need Help??

in reply to 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.

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!

      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.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://255732]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (10)
As of 2017-12-18 17:01 GMT
Find Nodes?
    Voting Booth?
    What programming language do you hate the most?

    Results (494 votes). Check out past polls.