An efficient C++ implementation of various sequential and parallel maximum flow algorithms.
-
Updated
Jan 22, 2020 - C++
An efficient C++ implementation of various sequential and parallel maximum flow algorithms.
Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University
Dinic's Algorithm for the Maximum Flow Problem.
Dinic's algorithm implementation for finding the maximum flow in a multi-source multi-sink flow network.
🛰️ An interactive visual simulator that models internet packet flow across a custom network using max-flow algorithms. It helps analyze routing efficiency using Dinic, Edmonds-Karp, Goldberg-Tarjan, Boykov-Kolmogorov and MCMF algorithms in real-time.
Collection of tools for few of the algorithms
Algorithm Design and Analysis Course (CSC340) project at Ain Shams University.
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.
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."