Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW
 
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?
[karlgoethebier]: The early bird catches the worm
holli enters he monastery hall, freezing but happy to have built the most beautiful snowman in the history of mankind
[holli]: tbh, the thing looks more like quasimode but hey, the thought matters. and it has blue LEDs as eyes

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (7)
As of 2017-12-18 05:49 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    What programming language do you hate the most?




















    Results (467 votes). Check out past polls.

    Notices?