This article examines transportation network modeling using the Ford–Fulkerson algorithm. It describes the process of finding a minimum cut using a graphical editor and library developed in the C# programming language. Key concepts of graph and network theory are presented to clarify the problem statement. An example of solving a transportation problem using the developed software is shown, and the program's results are compared with a control example.

Keywords: transportation network, maximum flow problem, Ford–Fulkerson algorithm, minimum cut in the network, software library, graphical editor, C# programming language