more useful options | |
PerlMonks |
Re: Dependency Inferenceby tlm (Prior) |
on Jul 12, 2005 at 23:53 UTC ( [id://474420]=note: print w/replies, xml ) | Need Help?? |
Basically the set of dependencies is (or should be) a directed acyclic graph. One does what's called a "topological sort" to determine the proper ordering of the nodes (it's nothing more than a post-ordering in a depth-first traversal). Take a look at Algorithm::Dependency. A standard approach to represent dependencies is to do list the "target" followed by all the items it directoy depends on. E.g. Both A::D and make use this basic idea. the lowliest monk
In Section
Seekers of Perl Wisdom
|
|