Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

Re^3: Sorting by dependencies

by LanX (Canon)
on Apr 27, 2013 at 21:33 UTC ( #1031015=note: print w/ replies, xml ) Need Help??

in reply to Re^2: Sorting by dependencies
in thread Sorting by dependencies

> Is it possible to combine different types of rules in this algorithm?

Well not A > B is equivalent to B >= A.

But the B == A part - i.e. B and A belong to the same phase - must be ignored, otherwise one risks that A comes after B in the unsorted output of a phase.

So translating to B > A should be safe, w/o loss of solutions.

Just modify the parser to translate different rules accordingly.

HTH! =)

Cheers Rolf

( addicted to the Perl Programming Language)

Comment on Re^3: Sorting by dependencies
Select or Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (5)
As of 2015-10-09 02:02 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (232 votes), past polls