I haven’t looked into it at all because I’ve been consumed with what’s there as it is.

If you have some suggestion of ways to extend what’s there, please feel I’m willing to listen.

 

 

From: SG19 <sg19-bounces@lists.isocpp.org> On Behalf Of Jeremy Murphy via SG19
Sent: Wednesday, October 23, 2024 3:29 AM
To: sg19@lists.isocpp.org
Cc: Jeremy Murphy <jeremy.william.murphy@gmail.com>
Subject: [isocpp-sg19] cardinal trees

 

EXTERNAL

Dear SG19,

I had a quick look through the current papers and firstly just wanted to quickly ask if you had given any thought to using this library for working with cardinal trees?

They don't exist in Boost.Graph; although one can obviously create a structure that looks superficially like one, the concepts defining efficient algorithms on them don't exist. 

There are some other libraries for creating a binary search tree, but they're quite specific in purpose, not generic. 

The best treatment of the topic is in Elements of Programming by Stepanov and McJones, which is freely available online.

There is also a C++Now talk about adding binary trees to Boost.Graph that explains the new concepts, etc. 

Thanks, cheers. 

Jeremy

 

 

--
SG19 mailing list
SG19@lists.isocpp.org
https://lists.isocpp.org/mailman/listinfo.cgi/sg19