`module OCAMLHashtbl = Stdlib.Hashtbl`

Specialized Ocamlgraph modules

`include sig ... end`
`val it : Dose_common__Util.Info.t`
`val info : ('a, unit, string, unit) Stdlib.format4 -> 'a`
`val nt : Dose_common__Util.Notice.t`
`val notice : ('a, unit, string, unit) Stdlib.format4 -> 'a`
`val wt : Dose_common__Util.Warning.t`
`val warning : ('a, unit, string, unit) Stdlib.format4 -> 'a`
`val dt : Dose_common__Util.Debug.t`
`val debug : ('a, unit, string, unit) Stdlib.format4 -> 'a`
`val fatal : ('a, unit, string, 'b) Stdlib.format4 -> 'a`
`val tr_timer : Dose_common.Util.Timer.t`
`val trbar : Dose_common.Util.Progress.t`
`module GraphOper (G : Graph.Sig.I) : sig ... end`

generic operation over imperative graphs

`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

`module ActionGraph : sig ... end`
`module PackageGraph : sig ... end`

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

`module IntPkgGraph : sig ... end`

Integer Imperative Bidirectional Graph. Mainly used in Strong Conflicts