, or in the module
itself (which is that bug I cited).
Steve
-Original Message-
From: Ben Tilly [mailto:bti...@gmail.com]
Sent: Tuesday, June 25, 2013 8:16 PM
To: Steve Tolkin
Cc: Boston Perl Mongers
Subject: Re: [Boston.pm] directed Graph modules in perl and CPAN
For a specific one-off specific
Divide and conquer.
1. Rename node numbers in each file from $n to $Filename.$n (during input
processing).
2. Set union of PRED_NODE lists of same-key nodes.
3. Rename nodes arbitrarily again, remove duplicates from merged lists;
possibly with a Topological Sort to make it less arbitrary.
--
[mailto:bti...@gmail.com]
Sent: Tuesday, June 25, 2013 8:16 PM
To: Steve Tolkin
Cc: Boston Perl Mongers
Subject: Re: [Boston.pm] directed Graph modules in perl and CPAN
For a specific one-off specific task like this, I would assume that
would take more work to find and evaluate a module that solves my
Summary: I went looking for a CPAN graph module so I could merge multiple
directed graphs. I found two that looked good, by famous Perl authors.
Unfortunately both have issues.
1. Graph::Easy looks good, but it has not changed in years and has a bug
list
For a specific one-off specific task like this, I would assume that
would take more work to find and evaluate a module that solves my
problem than it would take to roll my own solution.
Heck, in this case you can arrange it as a map-reduce. Your initial
map takes each file, and spits out
