I am working on improving Minimum Cost Maximum Flow in pgRouting using the cycle canceling algorithm. Since it is not efficient for large graphs, I plan to optimize it by adding better heuristics for detecting negative cycles and improving overall performance. This will be implemented using Boost Graph Library in C++.The cycle canceling algorithm is currently not implemented in pgRouting, and this project aims to introduce and optimize it. Any suggestions on this would be accepted by me.