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

cpp openmp maxflow push-relabel maximum-flow edmonds-karp-algorithm dinic-algorithm

• Updated Jan 22, 2020
• C++

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

java algorithm algorithms graph-algorithms data-structures dijkstra dynamic-programming dijkstra-algorithm data-structures-algorithms dsa prims-algorithm algorithms-and-data-structures dijkstra-shortest-path discrete-event-simulation data-structures-and-algorithms dijkstras-algorithm job-scheduling-algorithm dinic-algorithm job-scheduling prims-algorithm-java

• Updated Aug 8, 2022
• Java

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.

flow graph flownetwork-algorithms maximum-flow cpp20 edmonds-karp-algorithm flownetwork dinic-algorithm maximum-flow-solver graphs-algorithms maximum-flow-algorithm edmonds-karp

• Updated Jul 4, 2021
• C++

Dinic's Algorithm for the Maximum Flow Problem.

optimization constraint-programming maximum-flow dinic-algorithm

• Updated Feb 19, 2021
• Python

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

graph-algorithms quicksort mergesort network-flow backtracking sliding-puzzle sorting-algorithms heapsort 8-puzzle n-queens prims-algorithm bubblesort kruskals-algorithm prime-factorization dinic-algorithm ford-fulkerson-algorithm np-completeness bfs-search dfs-search edmund-karp-algorithm

• Updated Dec 7, 2020
• Python

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

flow-network maximum-flow dinic-algorithm

• Updated Jul 17, 2017
• C

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

scaling maxflow ford-fulkerson min-cut dinic-algorithm binary-image-segmentation edmonds-karp

• Updated Nov 28, 2021
• Python

🛰️ 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.

hacktoberfest daa mcmf dinic-algorithm design-and-analysis-of-algorithms edmonds-karp goldberg-tarjan internet-packet-simulator

• Updated Jun 25, 2025
• C++

Collection of tools for few of the algorithms

javascript flow algorithms dinic-algorithm

• Updated Feb 18, 2021
• JavaScript

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

network network-flow edmonds-karp-algorithm dinic-algorithm ford-fulkerson-algorithm algorithms-analysis algorithms-analysis-and-design algorithms-design

• Updated Jan 11, 2021
• C#

algorithms quicksort mergesort edit-distance data-structures time-complexity dynamic-programming heapsort breadth-first-search depth-first-search backtracking-search 8-puzzle maximum-flow exhaustive-search dinic-algorithm ford-fulkerson-algorithm edmund-karp-algorithm

• Updated Dec 15, 2019
• Python

Finding the Shortest Path Using the Dinic Algorithm

functional-programming ocaml shortest-path-algorithm dinic-algorithm

• Updated Oct 31, 2024
• OCaml

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.

r software-engineering edmond-karp computer-science-and-engineering dinic-algorithm maximum-flow-problem experimental-methods fctuc designing-experiment malhotra-pramodh-kumar-maheshwari

• Updated Jul 16, 2023
• HTML

visualization algorithms max-flow edmonds-karp-algorithm dinic-algorithm ford-fulkerson-algorithm preflow-push

• Updated Mar 20, 2024
• Python

Modern Fortran library providing graph data structures and algorithms.

graph-algorithms fortran data-structures scientific-computing conjugate-gradient fortran-library tarjan-algorithm strongly-connected-components dinic-algorithm maximum-flow-algorithm stoer-wagner-algorithm

• Updated Oct 2, 2026
• Fortran

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.

algorithms-and-data-structures max-flow dinic-algorithm

• Updated May 9, 2023
• Java

MVP for holiday shift assignment using max-flow, with a reusable C++ engine, TypeScript API, and React UI.

react portfolio express cmake typescript cpp optimization monorepo assignment-problem operations-research max-flow vite dinic-algorithm

• Updated Jul 26, 2026
• TypeScript

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

scaling maxflow ford-fulkerson min-cut dinic-algorithm binary-image-segmentation edmonds-karp

• Updated Nov 28, 2021
• Python

42 curriculum project - route a fleet of drones through a dynamic zone network from a start hub to an end hub, respecting zone types, capacities, and link constraints.

parsing rendering pygame dfs-algorithm 42school bfs-algorithm dinic-algorithm fly-in

• Updated Aug 10, 2026
• Python