Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
 
PerlMonks  

Re^3: Sorting by dependencies

by choroba (Canon)
on Apr 27, 2013 at 23:08 UTC ( #1031019=note: print w/ replies, xml ) Need Help??


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

In English and graph theory, they usually say "acyclic".

لսႽ ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ


Comment on Re^3: Sorting by dependencies
Re^4: Sorting by dependencies
by Laurent_R (Prior) on Apr 28, 2013 at 08:43 UTC
    Thank you for the correction.
Re^4: Sorting by dependencies
by tobyink (Abbot) on Apr 28, 2013 at 08:50 UTC

    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

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (8)
As of 2015-07-07 01:06 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (86 votes), past polls