Module Defaultgraphs.IntPkgGraph
Integer Imperative Bidirectional Graph. Mainly used in Strong Conflicts
module PkgV : sig ... end
module G : sig ... end
module S : sig ... end
module O : sig ... end
module DotPrinter : sig ... end
module DIn : sig ... end
module GmlPrinter : sig ... end
val add_edge : G.t -> G.vertex -> G.vertex -> unit
val conjdepgraph_int : G.t -> Cudf.universe -> G.vertex -> unit
add to the graph all conjunctive dependencies of package id
val conjdepgraph : Cudf.universe -> G.vertex list -> G.t
for all id \in idlist add to the graph all conjunctive dependencies
val conjdeps : G.t -> G.V.t -> G.V.t list
given a graph return the conjunctive dependency closure of the package id
val dependency_graph : ?conjunctive:bool -> Cudf.universe -> G.t
Build the dependency graph from the given index. conjunctive and disjunctive dependencies are considered as equal