-let get_parent tree ln =
- List.fold_left (fun acc n ->
- let n1 = get_firstBling tree n Naive_tree.nil in
- let n2 = Naive_tree.parent_of_first tree n1 in
- if n2 != Naive_tree.nil then union_list tree [n2] acc
- else acc
- ) [] ln
-
+let get_parent tree v =
+ let v0 = Bitvector.create (Naive_tree.size tree) in
+ (* let v = bitvector_of_nodes tree ln in*)
+ for i = 0 to (Bitvector.length v)-1 do
+ if Bitvector.get v i then
+ let n = Naive_tree.by_preorder tree i in
+ let n1 = get_firstBling tree n Naive_tree.nil in
+ let n2 = Naive_tree.parent_of_first tree n1 in
+ if n2 != Naive_tree.nil then begin let j = Naive_tree.preorder tree n2 in
+ Bitvector.set v0 j true
+ end
+ done;
+ v0
+
+let get_ancestor tree v =
+ let v0 = Bitvector.create (Naive_tree.size tree) in
+ (* let v = bitvector_of_nodes tree ln in *)
+
+ for i = (Bitvector.length v)-1 downto 0 do
+ if Bitvector.get v i then
+ let n = Naive_tree.by_preorder tree i in
+ let n0 = ref n in
+ while !n0 != Naive_tree.nil do
+ let n1 = get_firstBling tree !n0 Naive_tree.nil in
+ let n2 = Naive_tree.parent_of_first tree n1 in
+ n0 := n2;
+ if n2 != Naive_tree.nil then begin let j = Naive_tree.preorder tree n2 in
+ Bitvector.set v0 j true;
+ Bitvector.set v j true;
+ end
+ done;
+ done;
+ v0