package dose3

  1. Overview
  2. Docs
Dose library (part of Mancoosi tools)

Install

Dune Dependency

Authors

Maintainers

Sources

dose3-6.1.tar.gz
md5=dedc2f58f2c2b59021f484abc6681d93
sha512=603462645bac190892a816ecb36ef7b9c52f0020f8d7710dc430e2db65122090fdedb24a8d2e03c32bf53a96515f5b51499603b839680d0a7a2146d6e0fb6e34

doc/dose3.algo/Dose_algo/Defaultgraphs/PackageGraph/index.html

Module Defaultgraphs.PackageGraphSource

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

Sourcemodule PkgV : sig ... end
Sourcemodule G : sig ... end
Sourcemodule UG : sig ... end
Sourcemodule O : sig ... end
Sourcemodule S : sig ... end
Sourcemodule DotPrinter : sig ... end
Sourcemodule GmlPrinter : sig ... end
Sourcemodule GraphmlPrinter : sig ... end
Sourceval add_edge : ?transitive:bool -> G.t -> G.vertex -> G.vertex -> unit
Sourceval conjdepgraph_int : ?transitive:bool -> G.t -> Cudf.universe -> G.vertex -> unit

add to the graph all conjunctive dependencies of package id

Sourceval conjdepgraph : Cudf.universe -> G.vertex list -> G.t

for all id \in idlist add to the graph all conjunctive dependencies

Sourceval conjdeps : G.t -> G.V.t -> G.V.t list

given a graph return the conjunctive dependency closure of the package id

Sourceval dependency_graph_aux : bool -> G.t -> Cudf.universe -> G.vertex -> unit
Sourceval dependency_graph : ?conjunctive:bool -> Cudf.universe -> G.t

Build the dependency graph from the given cudf universe

Sourceval dependency_graph_list : ?conjunctive:bool -> Cudf.universe -> G.vertex list -> G.t

Build the dependency graph from the given list of packages

Sourceval conflict_graph_aux : UG.t -> Cudf.universe -> UG.vertex -> unit
Sourceval conflict_graph_list : Cudf.universe -> UG.vertex list -> UG.t

Build the conflict graph from the given list of packages

Sourceval conflict_graph : Cudf.universe -> UG.t

Build the conflict graph from the given cudf universe

Sourceval undirect : G.t -> UG.t
Sourceval connected_components : UG.t -> UG.V.t list list

Return the list of connected component of an undirected graph

Sourceval pred_list : G.t -> G.vertex -> G.vertex list
Sourceval succ_list : G.t -> G.vertex -> G.vertex list
Sourceval pred_set : G.t -> G.vertex -> S.t
Sourceval succ_set : G.t -> G.vertex -> S.t
Sourceval cycle_reduction : G.t -> unit
Sourceval out : ?dump:string option -> ?dot:string option -> ?detrans:bool -> G.t -> unit
Sourceval load : 'a -> string -> G.t
OCaml

Innovation. Community. Security.