On Wed, Jan 8, 2014 at 3:31 AM, leledumbo <leledumbo_c...@yahoo.co.id> wrote: > As in the data structure theory, a tree is just a graph without cycle. > So I guess it should be made that way. There are a lot of graph and tree > variations though, so I think I need to take some time to design before > implementing.
I don't know if the edges information can not be irrelevant and even an obstacle to better performance in trees. Anyway, good to know these plans. Thank you. _______________________________________________ fpc-pascal maillist - fpc-pascal@lists.freepascal.org http://lists.freepascal.org/cgi-bin/mailman/listinfo/fpc-pascal
