Module OpamCudf.GraphSource

Cudf graph

Graph of cudf packages

include module type of Dose_algo.Defaultgraphs.PackageGraph.G
Sourcetype t
module V : sig ... end
Sourcetype vertex = V.t
module E : sig ... end
Sourcetype edge = E.t
Sourceval is_directed : bool
Sourceval is_empty : t -> bool
Sourceval nb_vertex : t -> int
Sourceval nb_edges : t -> int
Sourceval out_degree : t -> vertex -> int
Sourceval in_degree : t -> vertex -> int
Sourceval mem_vertex : t -> vertex -> bool
Sourceval mem_edge : t -> vertex -> vertex -> bool
Sourceval mem_edge_e : t -> edge -> bool
Sourceval find_edge : t -> vertex -> vertex -> edge
Sourceval find_all_edges : t -> vertex -> vertex -> edge list
Sourceval succ : t -> vertex -> vertex list
Sourceval pred : t -> vertex -> vertex list
Sourceval succ_e : t -> vertex -> edge list
Sourceval pred_e : t -> vertex -> edge list
Sourceval iter_vertex : (vertex -> unit) -> t -> unit
Sourceval fold_vertex : (vertex -> 'a -> 'a) -> t -> 'a -> 'a
Sourceval iter_edges : (vertex -> vertex -> unit) -> t -> unit
Sourceval fold_edges : (vertex -> vertex -> 'a -> 'a) -> t -> 'a -> 'a
Sourceval iter_edges_e : (edge -> unit) -> t -> unit
Sourceval fold_edges_e : (edge -> 'a -> 'a) -> t -> 'a -> 'a
Sourceval map_vertex : (vertex -> vertex) -> t -> t
Sourceval iter_succ : (vertex -> unit) -> t -> vertex -> unit
Sourceval iter_pred : (vertex -> unit) -> t -> vertex -> unit
Sourceval fold_succ : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
Sourceval fold_pred : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
Sourceval iter_succ_e : (edge -> unit) -> t -> vertex -> unit
Sourceval fold_succ_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
Sourceval iter_pred_e : (edge -> unit) -> t -> vertex -> unit
Sourceval fold_pred_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
Sourceval create : ?size:int -> unit -> t
Sourceval clear : t -> unit
Sourceval copy : t -> t
Sourceval add_vertex : t -> vertex -> unit
Sourceval remove_vertex : t -> vertex -> unit
Sourceval add_edge : t -> vertex -> vertex -> unit
Sourceval add_edge_e : t -> edge -> unit
Sourceval remove_edge : t -> vertex -> vertex -> unit
Sourceval remove_edge_e : t -> edge -> unit
Sourceval of_universe : Cudf.universe -> t

Build a graph from a CUDF universe. Warning: dependency edges are towards the dependency, which is the reverse of what happens in the action graph.

Sourceval transitive_closure : t -> t

Return the transitive closure of g

Sourceval mirror : t -> t

Reverse the direction of all edges