http://lmgtfy.com/?q=C%23+build+tree
On Thu, May 28, 2009 at 9:22 AM, Emilio <[email protected]>wrote: > > > 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 >
