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

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.

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

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

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

💧 | 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.

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.

A Python toolkit for evaluating transport network extension proposals with cost criteria and maximum-flow algorithms.

Maximum flow logistics network analysis and Trie prefix tree extension.

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

A Network flow algorithm to find the shortest and most efficient routes. A modified Edmonds-Karp algorithm was used along with BFS. The data structure is a hash table.

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

High-performance pathfinding & flow optimization engine in C. Implements the Edmonds-Karp Max-Flow algorithm with greedy ant distribution. Optimized for AI-native engineering workflows and large-scale network topologies.