Cython trees and graphs
I wonder how fast Cython extension types are when it comes to graph like algorithms, e.g. construction and traversing trees and directed graphs.
I’ve seen a lot of examples of how much faster Cython is for stuff that involves arrays and loops, but I really need to experiment and see if I can increase the speed of the trees used for decision trees, for instance.
It’d also be interesting to see the speed compared to a purely static language and python dictionaries.