`sig
module type S =
sig
module Tree : Graph.Graphviz.GraphWithDotAttrs
module TreeManipulation :
sig
type t
val get_structure : DGraphTreeModel.S.TreeManipulation.t -> Tree.t
val get_tree_vertices :
Tree.V.label ->
DGraphTreeModel.S.TreeManipulation.t -> Tree.V.t list
val get_graph_vertex :
Tree.V.t -> DGraphTreeModel.S.TreeManipulation.t -> Tree.V.label
val is_ghost_node :
Tree.V.t -> DGraphTreeModel.S.TreeManipulation.t -> bool
val is_ghost_edge :
Tree.E.t -> DGraphTreeModel.S.TreeManipulation.t -> bool
end
type cluster = string
class tree_model :
XDot.Make(Tree).graph_layout ->
DGraphTreeModel.S.TreeManipulation.t ->
[Tree.V.t, Tree.E.t, DGraphTreeModel.S.cluster]
DGraphModel.abstract_model
val tree : unit -> DGraphTreeModel.S.TreeManipulation.t
end
module SubTreeMake :
functor (G : Graph.Graphviz.GraphWithDotAttrs) ->
sig
module Tree :
sig
type t
module V :
sig
type t
val compare : t -> t -> int
val hash : t -> int
val equal : t -> t -> bool
type label = G.V.t
val create : label -> t
val label : t -> label
end
type vertex = V.t
module E :
sig
type t
val compare : t -> t -> int
type vertex = vertex
val src : t -> vertex
val dst : t -> vertex
type label
val create : vertex -> label -> vertex -> t
val label : t -> label
end
type edge = E.t
val is_directed : bool
val is_empty : t -> bool
val nb_vertex : t -> int
val nb_edges : t -> int
val out_degree : t -> vertex -> int
val in_degree : t -> vertex -> int
val mem_vertex : t -> vertex -> bool
val mem_edge : t -> vertex -> vertex -> bool
val mem_edge_e : t -> edge -> bool
val find_edge : t -> vertex -> vertex -> edge
val find_all_edges : t -> vertex -> vertex -> edge list
val succ : t -> vertex -> vertex list
val pred : t -> vertex -> vertex list
val succ_e : t -> vertex -> edge list
val pred_e : t -> vertex -> edge list
val iter_vertex : (vertex -> unit) -> t -> unit
val fold_vertex : (vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges : (vertex -> vertex -> unit) -> t -> unit
val fold_edges : (vertex -> vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges_e : (edge -> unit) -> t -> unit
val fold_edges_e : (edge -> 'a -> 'a) -> t -> 'a -> 'a
val map_vertex : (vertex -> vertex) -> t -> t
val iter_succ : (vertex -> unit) -> t -> vertex -> unit
val iter_pred : (vertex -> unit) -> t -> vertex -> unit
val fold_succ : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val fold_pred : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_succ_e : (edge -> unit) -> t -> vertex -> unit
val fold_succ_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_pred_e : (edge -> unit) -> t -> vertex -> unit
val fold_pred_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val graph_attributes :
t -> Graph.Graphviz.DotAttributes.graph list
val default_vertex_attributes :
t -> Graph.Graphviz.DotAttributes.vertex list
val vertex_name : V.t -> string
val vertex_attributes :
V.t -> Graph.Graphviz.DotAttributes.vertex list
val default_edge_attributes :
t -> Graph.Graphviz.DotAttributes.edge list
val edge_attributes :
E.t -> Graph.Graphviz.DotAttributes.edge list
val get_subgraph :
V.t -> Graph.Graphviz.DotAttributes.subgraph option
end
module TreeManipulation :
sig
type t
val get_structure : t -> Tree.t
val get_tree_vertices : Tree.V.label -> t -> Tree.V.t list
val get_graph_vertex : Tree.V.t -> t -> Tree.V.label
val is_ghost_node : Tree.V.t -> t -> bool
val is_ghost_edge : Tree.E.t -> t -> bool
end
type cluster = string
class tree_model :
XDot.Make(Tree).graph_layout ->
TreeManipulation.t ->
[Tree.V.t, Tree.E.t, cluster] DGraphModel.abstract_model
val tree : unit -> TreeManipulation.t
val from_graph :
?depth_forward:int ->
?depth_backward:int ->
[> `widget ] Gtk.obj -> G.t -> G.V.t -> tree_model
end
module SubTreeDotModelMake :
sig
module Tree :
sig
type t
module V :
sig
type t
val compare : t -> t -> int
val hash : t -> int
val equal : t -> t -> bool
type label = DGraphModel.DotG.V.t
val create : label -> t
val label : t -> label
end
type vertex = V.t
module E :
sig
type t
val compare : t -> t -> int
type vertex = vertex
val src : t -> vertex
val dst : t -> vertex
type label
val create : vertex -> label -> vertex -> t
val label : t -> label
end
type edge = E.t
val is_directed : bool
val is_empty : t -> bool
val nb_vertex : t -> int
val nb_edges : t -> int
val out_degree : t -> vertex -> int
val in_degree : t -> vertex -> int
val mem_vertex : t -> vertex -> bool
val mem_edge : t -> vertex -> vertex -> bool
val mem_edge_e : t -> edge -> bool
val find_edge : t -> vertex -> vertex -> edge
val find_all_edges : t -> vertex -> vertex -> edge list
val succ : t -> vertex -> vertex list
val pred : t -> vertex -> vertex list
val succ_e : t -> vertex -> edge list
val pred_e : t -> vertex -> edge list
val iter_vertex : (vertex -> unit) -> t -> unit
val fold_vertex : (vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges : (vertex -> vertex -> unit) -> t -> unit
val fold_edges : (vertex -> vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges_e : (edge -> unit) -> t -> unit
val fold_edges_e : (edge -> 'a -> 'a) -> t -> 'a -> 'a
val map_vertex : (vertex -> vertex) -> t -> t
val iter_succ : (vertex -> unit) -> t -> vertex -> unit
val iter_pred : (vertex -> unit) -> t -> vertex -> unit
val fold_succ : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val fold_pred : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_succ_e : (edge -> unit) -> t -> vertex -> unit
val fold_succ_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_pred_e : (edge -> unit) -> t -> vertex -> unit
val fold_pred_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val graph_attributes : t -> Graph.Graphviz.DotAttributes.graph list
val default_vertex_attributes :
t -> Graph.Graphviz.DotAttributes.vertex list
val vertex_name : V.t -> string
val vertex_attributes :
V.t -> Graph.Graphviz.DotAttributes.vertex list
val default_edge_attributes :
t -> Graph.Graphviz.DotAttributes.edge list
val edge_attributes : E.t -> Graph.Graphviz.DotAttributes.edge list
val get_subgraph :
V.t -> Graph.Graphviz.DotAttributes.subgraph option
end
module TreeManipulation :
sig
type t
val get_structure : t -> Tree.t
val get_tree_vertices : Tree.V.label -> t -> Tree.V.t list
val get_graph_vertex : Tree.V.t -> t -> Tree.V.label
val is_ghost_node : Tree.V.t -> t -> bool
val is_ghost_edge : Tree.E.t -> t -> bool
end
type cluster = string
class tree_model :
XDot.Make(Tree).graph_layout ->
TreeManipulation.t ->
[Tree.V.t, Tree.E.t, cluster] DGraphModel.abstract_model
val tree : unit -> TreeManipulation.t
val from_model :
?depth_forward:int ->
?depth_backward:int ->
DGraphModel.dotg_model -> DGraphModel.DotG.V.t -> tree_model
end
end`