Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

Re^2: Sorting by dependencies

by Laurent_R (Monsignor)
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.

Comment on Re^2: Sorting by dependencies
Replies are listed 'Best First'.
Re^3: Sorting by dependencies
by choroba (Canon) 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?

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (7)
As of 2015-12-01 06:46 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (795 votes), past polls