Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: Graph traversal--shortest path?

by ferrency (Deacon)
on May 05, 2003 at 14:48 UTC ( #255640=note: print w/replies, xml ) Need Help??


in reply to Graph traversal--shortest path?

Mastering Algorithms with Perl by Jon Orwant, Jarkko Hietaniemi and John Macdonald, published by O'Reilly has a chapter on graphs and graph traversal algorithms. As the title suggests, the book covers much of the standard "algorithms" repertoire with an emphasis on implementation in Perl.

Personally, I'd ask how Any experienced programmer would approach the problem, and then figure out how to do it in Perl. When learning new algorithms and concepts, it can sometimes be easier to learn things in your native human lanugage first, and in a programming language only after you understand the basic flow of the algorithm.

Alan

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://255640]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (5)
As of 2019-11-14 22:22 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Strict and warnings: which comes first?



    Results (80 votes). Check out past polls.

    Notices?