go ahead... be a heretic | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
> 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) In reply to Re^3: Sorting by dependencies
by LanX
|
|