> So: A graph is also mathematically defined. And a tree is just a specialized graph.
Indeed :) I just realized that if you add an already existing node to other part of my tree such that it create a circular path, you have a graph, and both traversal algorithm will end up in infinite loop! (well, depending on the path, it might end up in out of memory first :p) So let's settle it up, there are tons of ready data structures and algorithm out there, including some in my code repository, both generics and data type specific, that will be useful to have in FPC. We already have scattered data structures and algorithm for the sake of Delphi compatibility (Classes.TList, Contnrs.TObjectList, etc.) so we shouldn't scratter more. I thought fcl-stl was a good place for this, but seeing that it's a container only package, things seem need to be reorganized. I'd be happy to donate when things get clearer. -- View this message in context: http://free-pascal-general.1045716.n5.nabble.com/State-of-fcl-stl-generics-lib-tp5712537p5712614.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/mailman/listinfo/fpc-pascal
