module Defaultgraphs: sig
.. end
Specialized Ocamlgraph modules
include struct ... end
val tr_timer : Common.Util.Timer.t
module GraphOper: functor (
G
:
Graph.Sig.I
) ->
sig
.. end
generic operation over imperative graphs
module SyntacticDependencyGraph: sig
.. end
syntactic dependency graph.
Imperative bidirectional graph for dependecies.
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.
module PkgV: sig
.. end
module PkgE: sig
.. end
module PackageGraph: MakePackageGraph
(
PkgV
)
(
PkgE
)
module IntPkgGraph: sig
.. end
Integer Imperative Bidirectional Graph
val intcudf : Cudf.universe ->
Graph.Imperative.Digraph.ConcreteBidirectional(IntPkgGraph.PkgV).t ->
Graph.Imperative.Digraph.ConcreteBidirectionalLabeled(PackageGraph.PkgV)(PackageGraph.PkgE).t
val cudfint : Cudf.universe ->
Graph.Imperative.Digraph.ConcreteBidirectionalLabeled(PackageGraph.PkgV)(PackageGraph.PkgE).t ->
Graph.Imperative.Digraph.ConcreteBidirectional(IntPkgGraph.PkgV).t
transform a cudf graph into a integer graph