in reply to Re: how to construct tree from parent pointer list
in thread how to construct tree from parent pointer list
I'd suggest something along these lines...
use Graph::Easy; my $graph = Graph::Easy->new(); my @nodes=('b:a','c:a','d:b','e:c','f:c'); my ($child,$parent); # build the graph foreach my $node (@nodes) { ($child,$parent) = split(":",$node); $graph->add_edge($parent,$child); } # print the graph print $graph->as_asciii();
I have no idea how to store this either.
Is there any reason you don't want to do this?
# save the graph by saving the list of original nodes open($filehandle,"<","nodes.dat") or die("Can't open file 'nodes.dat' +for writing: $!\n"); print $filehandle join("\n",@nodes);
--
Ytrew
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^3: how to construct tree from parent pointer list
by Anonymous Monk on Mar 22, 2006 at 17:06 UTC |