let check_strong transitive graph solver p l = List.iter (fun q -> if p <> q then if not(G.mem_edge graph p q) then if strong_depends solver p q then IntPkgGraph.add_edge transitive graph p q ) l