Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number
 
PerlMonks  

Re: Dependency Inference

by tlm (Prior)
on Jul 12, 2005 at 23:53 UTC ( [id://474420]=note: print w/replies, xml ) Need Help??


in reply to Dependency Inference

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.

myapp foo.o bar.o baz.o
Both A::D and make use this basic idea.

the lowliest monk

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://474420]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others wandering the Monastery: (3)
As of 2024-03-29 02:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found