This project was part of the lecture "Efficient Graph Algorithms" at TU Darmstadt, which I took as a motivation to learn some C++.
It implements several classical maximum flow algorithms:
- Ford Fulkerson
- Edmonds Karp
- Dinic
- Push Relabel
Additionally, a Qt-based GUI was created to visualize graphs and the step-by-step execution of these algorithms. To make the graph visualization more aesthetically pleasing, Poisson disk sampling was used, following:
Robert Bridson. Fast Poisson disk sampling in arbitrary dimensions. ACM SIGGRAPH 2007 Sketches (SIGGRAPH '07), Association for Computing Machinery, New York, NY, USA, 22–es.
https://doi.org/10.1145/1278780.1278807
- CMake 4.2.1
- Compiler: LLVM/Clang 21.1.8, targeting MSVC headers
- C++23 standard
- Qt 6