I have this problem
There are a collection of objects, each object has it properties and a list of objects that depens of. So I want to generate a Directly Acyclic Graph, that can model the dependency of every object. Also mutual conection doesn't exists, so object A depends object B, so object B can't depends object A, thats a rule that must follow every object, if happens then object A and object B automatically get merge in object C, so A+B=C. There is an algorithm for this situation?