diff options
| author | Nagy Gabor <ngaba@petra.hos.u-szeged.hu> | 2007-06-10 23:51:20 +0200 |
|---|---|---|
| committer | Dan McGee <dan@archlinux.org> | 2007-06-10 22:13:58 -0400 |
| commit | 544bcbe6641bb94a429a9c149893bc0b07fd2619 (patch) | |
| tree | 7e88da506f5c1269a8014688c08b4bec63505eb9 /missing | |
| parent | 8588b4823b579bc41909734f5a13a420d64487d6 (diff) | |
Implement simple topological sort algorithm for sortbydeps
Based on the "depth first search" algorithm, for more infos visit:
http://en.wikipedia.org/wiki/Topological_sorting
The previous algorithm used by sortbydeps was too slow, and to work around
it the number of steps needed to get correct result was reduced greatly.
So it produced wrong results in several cases :
1) smoke001.py
2) http://bugs.archlinux.org/task/7229
More here: http://archlinux.org/pipermail/pacman-dev/2007-April/008057.html
Signed-off-by: Chantry Xavier <shiningxc@gmail.com>
Signed-off-by: Dan McGee <dan@archlinux.org>
Diffstat (limited to 'missing')
0 files changed, 0 insertions, 0 deletions