Module `Defaultgraphs.PackageGraph`

Imperative bidirectional graph for dependecies. Imperative unidirectional graph for conflicts.

module PkgV : sig ... end

module G : sig ... end

module UG : sig ... end

module O : sig ... end

module S : sig ... end

module DotPrinter : sig ... end

module GmlPrinter : sig ... end

module GraphmlPrinter : sig ... end

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_aux : bool -> G.t -> Cudf.universe -> G.vertex -> unit
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_aux : UG.t -> Cudf.universe -> UG.vertex -> unit
val conflict_graph_list : Cudf.universe -> UG.vertex list -> UG.t: Build the conflict 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