http://www.perlmonks.org?node_id=194236


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

    Graph.pm takes care of circular references for you.

    After Compline,
    Zaxo