4 This is libsolv, a free package dependency solver using a satisfiability
7 The code is based on two major, but independent, blocks:
9 1. Using a dictionary approach to store and retrieve package and
10 dependency information in a fast and space efficient manner.
12 2. Using satisfiability, a well known and researched topic, for
13 resolving package dependencies.
15 The sat-solver code has been written to aim for the newest packages,
16 record the decision tree to provide introspection, and also provides
17 the user with suggestions on how to deal with unsolvable
18 problems. It also takes advantage of repository storage to
19 minimize memory usage.
21 Supported package formats:
28 Supported repository formats:
30 - rpmmd (primary, filelists, comps, deltainfo/presto, updateinfo)
31 - susetags, suse product formats
32 - mandriva/mageia (synthesis, info, files)
34 - red carpet helix format
40 Requires: cmake 2.8.5 or later