edmonds-karp

Pathfinding library for rust

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.

Ford Fulkerson interactive demo

Given the standings in a sports league at some point during the season, determine which teams have been mathematically eliminated from winning their division.

Network-flows: a c++ command line tool for network optimization problems

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

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

An early 01Founders project on graph traversal algorithms and maximum flow.

Efficient network algorithm to find the maximum flow within a network, with flow limitations.

A webapp to visualize the Ford-Fulkerson and Edmonds-Karp max flow algorithms. Below is the link to the website!

EV charging allocation platform: bipartite matching, Edmonds-Karp max flow, randomized Quickselect and a segment tree built from scratch in Java 21, with a Spring Boot 4 API, PostgreSQL 18 and a React 19 console.

Python algorithms project featuring a Trie-based spell checker and an Edmonds-Karp activity assignment solver.

Ant colony max-flow pathfinding engine (Edmonds-Karp / BFS with vertex splitting), optimal turn scheduler in Go, and HTML5 Canvas visualizer

💧 | A real-world application of the Edmonds-Karp algorithm for optimizing a water management system

Use of graph theory to optimize snow removal routes in Montreal and finding an optimal drone flight path to cover all streets in a city. Process of making a graph Eulerian and the use of Edmond-Karp and Bellman-Ford algorithms.

This project includes, Network Connectivity Analysis, Pair Matching, and Link Prediction with Random Forest.

C implementation of graph algorithms for network routing using Bidirectional Search, Edmonds-Karp, and multiple graph representations to optimize data transfer.

Implementations of various algorithms including Hamiltonian Cycle, Kruskal, Prim, Boruvka, Edmonds-Karp, Gale-Shapley, Brélaz and Sequential Coloring regarding graph theory in Java

Risk-aware resupply routing for contested logistics: min-cost flow, Edmonds-Karp max-flow/min-cut, and budget-constrained network interdiction. This Operations-research toolkit for contested-logistics routing and interdiction. From-scratch min-cost flow, max-flow/min-cut, and NP-hard interdiction is companion code to a 4-day algorithms unit.

Edmonds-Karp network flow engine with BFS augmenting paths computing maximum flow and minimum cut bottlenecks for multi-agent routing.