sig
type graph
and node
val iter_nodes :
(Avl_kernel.GRAPH_acyclic.node -> unit) ->
Avl_kernel.GRAPH_acyclic.graph -> unit
val iter_successors :
(Avl_kernel.GRAPH_acyclic.node -> unit) ->
Avl_kernel.GRAPH_acyclic.node -> unit
val get : Avl_kernel.GRAPH_acyclic.node -> int
val set : Avl_kernel.GRAPH_acyclic.node -> int -> unit
end