Re^2: Sorting by dependencies

I think that's what Rolf was talking about when he spoke about circular dependencies.

You need to end up with (what we called in my IT studies, my translation into English might be faulty) a cycle-less oriented graph.

Comment on Re^2: Sorting by dependencies

Replies are listed 'Best First'.
Re^3: Sorting by dependencies by choroba (Cardinal) on Apr 27, 2013 at 23:08 UTC
In English and graph theory, they usually say "acyclic". لսႽ† ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ	[reply]
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]