Functor Defaultgraphs.MakePackageGraph


module MakePackageGraph: 
functor (V : Sig.COMPARABLE with type t = Cudf.package) ->
functor (E : Graph.Sig.ORDERED_TYPE_DFT) -> sig .. end
Imperative unidirectional graph for conflicts.
Parameters:
V : Sig.COMPARABLE with type t = Cudf.package
E : Graph.Sig.ORDERED_TYPE_DFT

module PkgV: V
module PkgE: E
module G: Graph.Imperative.Digraph.ConcreteBidirectionalLabeled(PkgV)(PkgE)
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 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.t list
Return the list of connected component graphs
val out : ?dump:string option ->
?dot:string option ->
?detrans:bool -> G.t -> unit