> The best way is to build a graph structure of dependencies. > Any loop (ie. a non-tree structure, where a child references the parent > again ) is a recursion.
Thank you, how can I build this graph ? Emilio
> The best way is to build a graph structure of dependencies. > Any loop (ie. a non-tree structure, where a child references the parent > again ) is a recursion.
Thank you, how can I build this graph ? Emilio