From: armelasselin@hotmail.com   
      
   "Vincent Belliard"  a icrit   
   > If you have a tree structure for your objects, it's obvious : you just   
   > have to count reference on objects and then delete objects when the count   
   > reach 0.   
   >   
   > If you have a graph structure, it's quite difficult. If you have a loop   
   > with your objects, you won't be able to delete it even if it's not   
   > referenced anymore.   
      
   note that garbage collection in multi-threaded application was proven to be   
   possible using reference counts, even for cyclic graphs.   
   there is paper called "Concurrent Cycle Collection in Reference Counted   
   Systems", June 2001, from David F. Bacon and V.T. Rajan   
      
   Regards   
   Armel   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)