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