Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re^2: Sorting by dependencies

by Laurent_R (Abbot)
on Apr 27, 2013 at 22:19 UTC ( #1031017=note: print w/ replies, xml ) Need Help??


in reply to Re: Sorting by dependencies
in thread 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.

Replies are listed 'Best First'.
Re^3: Sorting by dependencies
by choroba (Chancellor) on Apr 27, 2013 at 23:08 UTC
    In English and graph theory, they usually say "acyclic".
    لսႽ ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ

      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
      Thank you for the correction.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (6)
As of 2016-06-29 06:52 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My preferred method of making French fries (chips) is in a ...











    Results (369 votes). Check out past polls.