Finding the Shortest Path Using the Dinic Algorithm

PUBLIC | Faculdade de Ciências e Tecnologia da Universidade de Coimbra (FCTUC) - Mestrado em Engenharia Informática (MEI) - Percurso: Engenharia de Software - 2022/2023 | Metodologias Experimentais em Informática (MEI) - Projeto: design the experiment to investigate the runtime performance of these three algorithms in practice.

This is a school project from Data Structures and Algorithms course where network flow graph, Dinic's Algorithm are used effectively. It is an application of finding maximum flow on network flow graphs. The aim of the project is make sure to supply as many flow from source to sink.

Five Java projects assigned for the Data Structures and Algorithms (CMPE 250) course in the Fall 2021-22 semester.

To analyse the performance of different max-flow/min-cut algorithms like Ford-Fulkerson, Edmonds-Karp, Scaling and Dinic’s on the basis of Binary Image Segmentation

To analyse the performance of different max-flow/min-cut algorithms like Ford-Fulkerson, Edmonds-Karp, Scaling and Dinic’s on the basis of Binary Image Segmentation

Academical implementation of Edmonds-Karp algorithm in O(nm²) and Dinitz (Dinic) algorithm O(n²m) for computing the maximum flow of a flow network.

Dinic's Algorithm for the Maximum Flow Problem.

Collection of tools for few of the algorithms

Algorithm Design and Analysis Course (CSC340) project at Ain Shams University.

Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University

An efficient C++ implementation of various sequential and parallel maximum flow algorithms.

Dinic's algorithm implementation for finding the maximum flow in a multi-source multi-sink flow network.