let conjdepgraph_int ?(transitive=false) graph univ p =
G.add_vertex graph p;
List.iter (fun vpkgs ->
match CudfAdd.resolve_deps univ vpkgs with
|[q] when not(CudfAdd.equal q p) -> add_edge ~transitive graph p q
|_ -> ()
) p.Cudf.depends