Actually, I'm planning on redesigning gtree to be a part of larger ggraph unit. 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. Besides, I'm a bit busy these days.
-- View this message in context: http://free-pascal-general.1045716.n5.nabble.com/gtree-Freeing-a-nil-Root-without-error-tp5717832p5717836.html Sent from the Free Pascal - General mailing list archive at Nabble.com. _______________________________________________ fpc-pascal maillist - fpc-pascal@lists.freepascal.org http://lists.freepascal.org/cgi-bin/mailman/listinfo/fpc-pascal
