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

In English and graph theory, they usually say "acyclic".
لսႽ† ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ

Replies are listed 'Best First'.
Re^4: Sorting by dependencies
by tobyink (Canon) 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
[reply]
Re^4: Sorting by dependencies
by Laurent_R (Canon) on Apr 28, 2013 at 08:43 UTC
    Thank you for the correction.
[reply]

In Section Seekers of Perl Wisdom