Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

(Golf) Shortest Graph Distance

by Masem (Monsignor)
on May 11, 2001 at 22:49 UTC ( #79811=perlmeditation: print w/ replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    %g = ( Chicago => { Cleveland=>400 },
           Cleveland => { Chicago=>400 } );
    
  2. or download this
    my %g = ( Chicago=>{ Detroit=>250,
                         Cleveland=>400,
    ...
    d( \%g, 'Denver', 'Cleveland' ); # should be ( 'Denver', 'Chicago', 'C
    +leveland' )
    d( \%g, 'Cleveland', 'Denver' ); # should be 
    ( 'Cleveland', 'Chicago', 'Denver' );
    

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (3)
As of 2014-08-21 05:05 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (127 votes), past polls