C # implementation of the maximum flow problem

摘要

The maximum network flow problem is a fundamental problem in network flow theory. The Ford-Fulkerson and Edmonds-Karp algorithm are popular optimization algorithms for computing the network flow. The current paper presents a C# implementation of Ford-Fulkerson and Edmonds-Karp algorithms for solving the maximum flow problem in networking.