module PackageGraph: MakePackageGraph(PkgV)
module PkgV: V
module G: Graph.Imperative.Digraph.ConcreteBidirectional(PkgV)
module UG: Graph.Imperative.Graph.Concrete(PkgV)
module O: Defaultgraphs.GraphOper(G)
module S: Set.Make(PkgV)
module DisplayF: functor (G : Graph.Sig.I) -> sig .. end
module Display: DisplayF(G)
module D: Graph.Graphviz.Dot(Display)
val add_edge : ?transitive:bool ->
G.t ->
G.vertex ->
G.vertex -> unit
val conjdepgraph_int : ?transitive:bool ->
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 cudf universe
val dependency_graph_list : ?conjunctive:bool ->
Cudf.universe ->
G.vertex list ->
G.t
Build the dependency graph from the given list of packages
val conflict_graph : Cudf.universe -> UG.t
Build the conflict graph from the given cudf universe
val undirect : G.t -> UG.t
val connected_components : UG.t ->
UG.V.t list list
Return the list of connected component of an undirected graph
val pred_list : G.t ->
G.vertex ->
G.vertex list
val succ_list : G.t ->
G.vertex ->
G.vertex list
val pred_set : G.t ->
G.vertex -> S.t
val succ_set : G.t ->
G.vertex -> S.t
val cycle_reduction : G.t -> unit
val out : ?dump:string option ->
?dot:string option ->
?detrans:bool -> G.t -> unit
val load : 'a -> string -> G.t