Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

Re: H of A optimization

by abitkin (Monk)
on Aug 30, 2002 at 20:12 UTC ( #194236=note: print w/replies, xml ) Need Help??

in reply to H of A optimization

I'd like to note, the only reason I'm asking here, is every time I do, I learn a new trick to help myself out.

Replies are listed 'Best First'.
Re: Re: H of A optimization
by Zaxo (Archbishop) on Aug 30, 2002 at 23:39 UTC

    Ok, dpuu suggested Graph, which I recommend. This does it:

    #!/usr/bin/perl -w use strict; use Graph::Undirected; my $net = Graph::Undirected->new; while (<DATA>) { $net = $net->add_edge( split ); } use Data::Dumper; print Dumper($net); __END__ 0 1 1 2 1 3 1 4 2 4 4 5 takes care of circular references for you.

    After Compline,

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (3)
As of 2020-05-29 10:14 GMT
Find Nodes?
    Voting Booth?
    If programming languages were movie genres, Perl would be:

    Results (169 votes). Check out past polls.