module SyntacticDependencyGraph: sig
.. end
Syntactic dependency graph. Vertices are cudf packages,
OR nodes representing a disjunctive dependency, or Missing nodes
representing a missing package. The latter is used to display explanation
graphs. Vertices are indexed considering only the pair name,version .
Edges are labelled with
OrDepends
: disjuctive dependency
DirDepends
: direct dependecy
Conflict
: conflict
type
pkg = {
|
value : Cudf.package ; |
|
root : bool ; |
}
module PkgV: sig
.. end
module PkgE: sig
.. end
val default_pp : Common.CudfAdd.pp Pervasives.ref
module G: Graph.Imperative.Digraph.ConcreteBidirectionalLabeled
(
PkgV
)
(
PkgE
)
module DotPrinter: sig
.. end
module S: Set.Make
(
PkgV
)
module GmlPrinter: Graph.Gml.Print
(
G
)
(
sig
val node : Defaultgraphs.SyntacticDependencyGraph.G.V.label -> 'a list
val edge : Defaultgraphs.SyntacticDependencyGraph.G.E.label -> 'a list
end
)
module GraphmlPrinter: Graph.Graphml.Print
(
G
)
(
sig
val vertex_properties : (string * string * 'a option) list
val edge_properties : (string * string * 'a option) list
val map_edge : 'a -> 'b list
val map_vertex : Defaultgraphs.SyntacticDependencyGraph.PkgV.t -> (string * string) list
val edge_uid : 'a -> int
val vertex_uid : 'a -> int
end
)
val depgraphbar : Common.Util.Progress.t
val add_edge : G.t ->
G.vertex ->
PkgE.s ->
G.vertex -> unit
val dependency_graph : ?root:Cudf.package ->
Cudf.universe -> G.t
Build the syntactic dependency graph from the give cudf universe
val all_paths : G.t ->
G.V.t -> unit
val pp : G.V.t -> string
val all_paths : G.t ->
G.V.t -> unit