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.

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

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

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

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

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.

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

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 program to solve the Bus-Driver Assignment problem using the Ford-Fulkerson and Edmonds–Karp algorithm and comparision between the algorithms.

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.

Präsentation und Code zum Seminarthema 10 - Maximale Flüsse

Design of Algorithms course first project