This project involves solving Pareto Front optimization problem by reading data file plotting the data and visualizing it. Additionally, a filtering dialog box is implemented to enable filtering based on: objective value, normalized objective and relative position. The task involves connecting these filtering methods to the logic and applying them.
The Edmonds-Karp algorithm implements the Ford-Fulkerson method for computing the maximum flow in a flow network. It leverages a breadth-first search (BFS) to find augmenting paths, ensuring that the shortest path in terms of the number of edges is chosen. This report discusses the implementation of the algorithm, enhanced with graphical visualizer.
