This project visualizes the Ford-Fulkerson algorithm using Manim, a mathematical animation engine. The animation demonstrates step-by-step how the algorithm finds the maximum flow in a flow network.

Ford-Fullkerson-Algorithm/ ├── src/ # Source code │ ├── utils.h/.c # Utility functions and data structures │ ├── graph.h/.c # Graph representation and operations │ ├── path.h/.c # Path finding ...

Abstract: Ford-Fulkerson algorithm is widely used to solve maximum Graph-Flow problems and it can be applied to a range of different areas, including networking. This paper proposes an approach based ...

Abstract: The use of mmWave frequencies is expected to be one of the most promising technologies deployed by future cellular networks, due to the high available bandwidth they can provide. Moreover, ...