资 源 简 介
In a large software ecosystem such as Debian Linux, there is the potential for dependencies among software packages to create complex management and technical problems. For example, dependency loops (cycles) in which a package directly or indirectly depends on itself can confuse package management tools as they determine the proper order of package installation. debgraph helps developers to solve this problem by enabling generic queries (e.g., "Give me all the nodes that depend on package X") against the graph of packages and thus automating much of the manual labor that is typically involved in resolving dependency problems.
To learn more, please download the source distribution and refer to the GettingStarted page in the wiki.
文 件 列 表
debgraph-0.1.1
nulltest.cc
testkit.h
xor.h
dgoperator.h
edge.h
dgunaryoperator.h
edge.cc
node.h
dgbinaryoperator.cc
nulltest.h
intersection.h
filter.cc
memacct.h
structure.h
findcycles.h
cyclictest.cc
filter.h
tests
TODO
entity.cc
dgbinaryoperator.h
SOC
difference.cc
entity.h
debian.h
finddeps.h
findreversedeps.h
Makefile
debgraph
main.cc
findreversedeps.cc
intersection.cc
graph.cc
.svn
HACKING
cyclictest.h
graph.h
README
memacct.cc
structure.cc
parser.cc
dgunaryoperator.cc
lua
union.cc
graphiterator.cc
doc
COPYING
testkit.cc
vercmp.cc
parser.h
union.h
finddeps.cc
version.h
graph_types.h
debian.cc
xor.cc
dgoperator.cc
scripts
difference.h
graphiterator.h
vercmp.h
findcycles.cc
node.cc
