open Common

(* todo:
 *  invariant succesors/predecessors
 *  see c++ library, GTL ...
 *  (cf paper from ASTL, cf paper from jfla05 on ocamlgraph)
 *)

class virtual ['a] ograph =
object(o: 'o)
  method virtual empty: 'o

  method virtual add_node: 'a -> 'o
  method virtual del_node: 'a -> 'o

  method virtual add_arc: ('a * 'a) -> 'o
  method virtual del_arc: ('a * 'a) -> 'o

  method virtual successors: 'a -> 'a Oset.oset
  method virtual predecessors: 'a -> 'a Oset.oset

  method virtual nodes: 'a Oset.oset

  method virtual ancestors: 'a Oset.oset -> 'a Oset.oset
  method virtual children: 'a Oset.oset -> 'a Oset.oset
  method virtual brothers: 'a -> 'a Oset.oset

  method mydebug: ('a * 'a list) list =
    (o#nodes)#tolist +> map (fun a -> (a, (o#successors a)#tolist))
end