module IntPkgGraph: sig
.. end
Integer Imperative Bidirectional Graph
module PkgV: sig
.. end
module G: Graph.Imperative.Digraph.ConcreteBidirectional
(
PkgV
)
module S: Set.Make
(
PkgV
)
module O: Defaultgraphs.GraphOper
(
G
)
module DotPrinter: sig
.. end
module DIn: Graph.Dot.Parse
(
Graph.Builder.I
(
G
)
)
(
sig
val node : Graph.Dot_ast.id * 'a -> 'b -> int
val edge : 'a -> unit
end
)
module GmlPrinter: Graph.Gml.Print
(
G
)
(
sig
val node : Defaultgraphs.IntPkgGraph.G.V.label -> 'a list
val edge : Defaultgraphs.IntPkgGraph.G.E.label -> 'a list
end
)
val add_edge : 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 index. conjunctive and
disjunctive dependencies are considered as equal
val dependency_graph_list : ?conjunctive:bool ->
Cudf.universe ->
G.vertex list -> G.t
val load : 'a -> string -> G.t