in reply to Re: Graph traversal--shortest path?
in thread Graph traversal--shortest path?

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!

  • Comment on Re: Re: Graph traversal--shortest path?

Replies are listed 'Best First'.
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.