William Fiset
William Fiset
The generic segment tree implementation seems to be suffering from two issues when using multiplication range updates with min/max range queries: * The segment tree doesn't seem to handle overflow...
With this make sure to add the ability to find the Least Common Ancestor (LCA) and the shortest distance between two nodes.
The current implementation of the Bellman Ford min-cost flow algorithms seems to only support non-negative edge costs, but in reality, they should be able to handle negative weighted edges.
To polish off the suffix array data structure we still need to: - [ ] Add tests - [ ] Automate detecting alphabet shift size - [ ] Finish nlogn...