Re^2: Sorting by dependencies

Thanks everybody for the detailed help.

Especially LanX' version is great, basically 6 lines of codes are doing the job and validating the input at the same time.

Thanks a lot!!!

Just one more question:

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

A not after B"
B after C
[download]

Thanks
Axel

Comment on Re^2: Sorting by dependencies Download Code

Replies are listed 'Best First'.
Re^3: Sorting by dependencies by LanX (Saint) on Apr 27, 2013 at 21:33 UTC
> 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)	[reply] [d/l] [select]

Replies are listed 'Best First'.

Re^3: Sorting by dependencies
by LanX (Saint) on Apr 27, 2013 at 21:33 UTC

> 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)

[reply]
[d/l]
[select]