module SyntacticDependencyGraph: sig
.. end
syntactic dependency graph. Vertex are Cudf packages and
are indexed considering only the pair name,version .
Edges are labelled with
OrDepends
: disjuctive dependency
DirDepends
: direct dependecy
Conflict
: conflict
module PkgV: sig
.. end
module PkgE: sig
.. end
module G: Graph.Imperative.Digraph.ConcreteBidirectionalLabeled
(
PkgV
)
(
PkgE
)
val string_of_vertex : G.V.t -> string
val string_of_edge : G.E.t -> string
module Display: sig
.. end
module DotPrinter: Graph.Graphviz.Dot
(
Display
)
Graphviz outoput module
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
)
val depgraphbar : Common.Util.Progress.t
val dependency_graph : Cudf.universe -> G.t
Build the syntactic dependency graph from the give cudf universe