Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re: Sorting by dependencies

by exilepanda (Pilgrim)
on Apr 28, 2013 at 05:40 UTC ( #1031030=note: print w/replies, xml ) Need Help??


in reply to Sorting by dependencies

In project management, there's kind of model like this called "Critical Path" which intend to resolve dependency. Whatever approach you are trying to adopt, you want to consider these 2 situation

A after B B after C C after A
This is loop back. You might want to stop the user by saving this record. The dependency will never able to resolve.

Lunch after Breakfast Dinner after Lunch Dinner after Breakfast
There's no logical problem, however your presentation maybe going clumsy. You might want some mechanism for "normalization".

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1031030]
help
Chatterbox?
[Eily]: I've posted my fourth root node on perlmonks and I haven't even been a monk for four years yet. I'm on fire \o/
[ambrus]: Eily: hmm... do you count your user and your scratchpad as root nodes you posted?
[Eily]: I would have if it had been convenient :P

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (9)
As of 2017-03-24 14:40 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Should Pluto Get Its Planethood Back?



    Results (304 votes). Check out past polls.