Algorithm Design and Analysis Course (CSC340) project at Ain Shams 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.
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
Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University
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.
Five Java projects assigned for the Data Structures and Algorithms (CMPE 250) course in the Fall 2021-22 semester.
Collection of tools for few of the algorithms
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.
Dinic's Algorithm for the Maximum Flow Problem.
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.
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
Add a description, image, and links to the dinic-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the dinic-algorithm topic, visit your repo's landing page and select "manage topics."