Hi. I am attempting to build a dependency tree using the Tree::DAG_Node module and then perform a postorder transversal of the tree.
During my search for a solution, I ran across
tadman's
(Golf) Dependency List Prioritization post. This code appears to solve my dependency problem (no pub intended).
my @list = f(
a => [ 'b', 'c' ],
b => [ 'c', 'd' ],
c => [ 'd' ],
e => [ 'b', 'a' ],
f => undef,
);
sub f {
$h{$_}||=[]for map@$_,%h=@_;
sub x {
my$x=1;
$x+=x($_)for@{@h{@_}||[]};
$x
}
sort{x($a)<=>x$b}keys%h
}
However, having read through, in advance,
gmax's tutorial
A crash course on trees, I am itching to use the Tree::DAG_Node module to solve this problem.
The stumbling block I am encountering is that I do not know how to take a data structure, such as tadman's in the code snippet above, and then programmatically create a Directed Acyclic Graph. With the tree constructed, I can then use the "walk_down" method with the callbackback option for a postorder scan.
Any assistance will be greatly appreciated. Thanks.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.