Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re^4: Sorting by dependencies

by tobyink (Abbot)
on Apr 28, 2013 at 08:50 UTC ( #1031045=note: print w/ replies, xml ) Need Help??


in reply to Re^3: Sorting by dependencies
in thread Sorting by dependencies

In this case, the jargon "DAG" (directed acyclic graph) would be appropriate.

package Cow { use Moo; has name => (is => 'lazy', default => sub { 'Mooington' }) } say Cow->new->name


Comment on Re^4: Sorting by dependencies

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (7)
As of 2014-11-26 06:32 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My preferred Perl binaries come from:














    Results (162 votes), past polls