Compute trajectories using a minimum-cost maximum-flow approach. Julia frontend, C++/C backend. Using an edited C++ port of C code (https://github.com/eigenpi/CS2-CPP)
-
Updated
Dec 7, 2018 - C++
Compute trajectories using a minimum-cost maximum-flow approach. Julia frontend, C++/C backend. Using an edited C++ port of C code (https://github.com/eigenpi/CS2-CPP)
This project is about finding the maximum voltage in a cable-port matrix using the minimum-cost maximum-flow algorithm.
Add a description, image, and links to the minimum-cost-maximum-flow topic page so that developers can more easily learn about it.
To associate your repository with the minimum-cost-maximum-flow topic, visit your repo's landing page and select "manage topics."