# Java Network Max-Flow Visualizer
@Author: Massiles GHERNAOUT
This project provides a visualization of the Ford-Fulkerson algorithm
for computing the maximum flow and minimum cut in a flow network.
Upon running the visualizer, a graphical representation of a flow network
will be displayed. The sturated edges will be colored in red.