Module Strongdeps_int

module Strongdeps_int: sig .. end
Strong Dependencies

val mainbar : Common.Util.Progress.t
val conjbar : Common.Util.Progress.t
val strongtimer : Common.Util.Timer.t
val conjtimer : Common.Util.Timer.t
val label : string
include struct ... end
module G: Defaultgraphs.PackageGraph.G
module O: Defaultgraphs.PackageGraph.O
val strong_depends : Depsolver_int.solver ->
Common.Util.IntHashtbl.key -> Common.Util.IntHashtbl.key -> bool
check if p strongly depends on q. We check if it is possible to install p without q.
val check_strong : Cudf.universe ->
bool ->
G.t ->
Depsolver_int.solver ->
Common.Util.IntHashtbl.key -> Common.Util.IntHashtbl.key list -> unit
check if p strong depends on any packages in l
val somedisj : Depsolver_int.pool -> int -> bool
val strongdeps_int : ?transitive:bool -> G.t -> Cudf.universe -> G.vertex list -> G.t
strongdeps l build the strong dependency graph of l
val strongdeps : ?transitive:bool -> Cudf.universe -> G.vertex list -> G.t
val strongdeps_univ : ?transitive:bool -> Cudf.universe -> G.t

return the impact set (list) of the node q in graph
val impactlist : Defaultgraphs.PackageGraph.G.t ->
Defaultgraphs.PackageGraph.G.vertex ->
Defaultgraphs.PackageGraph.G.vertex list
invariant : we assume the graph is NOT detransitivitized

return the list of strong dependencies of the node q in graph
val stronglist : Defaultgraphs.PackageGraph.G.t ->
Defaultgraphs.PackageGraph.G.vertex ->
Defaultgraphs.PackageGraph.G.vertex list
invariant : we assume the graph is NOT detransitivitized
val impactset : Defaultgraphs.PackageGraph.G.t ->
Defaultgraphs.PackageGraph.G.vertex -> Defaultgraphs.PackageGraph.S.t
val strongset : Defaultgraphs.PackageGraph.G.t ->
Defaultgraphs.PackageGraph.G.vertex -> Defaultgraphs.PackageGraph.S.t