Defaultgraphs.IntPkgGraphInteger Imperative Bidirectional Graph. Mainly used in Strong Conflicts
module PkgV : sig ... endmodule G : sig ... endmodule S : sig ... endmodule O : sig ... endmodule DotPrinter : sig ... endmodule DIn : sig ... endmodule GmlPrinter : sig ... endadd to the graph all conjunctive dependencies of package id
for all id \in idlist add to the graph all conjunctive dependencies
given a graph return the conjunctive dependency closure of the package id
val dependency_graph : ?conjunctive:bool -> Cudf.universe -> G.tBuild the dependency graph from the given index. conjunctive and disjunctive dependencies are considered as equal
val load : 'a -> string -> G.t