大学数学-Computing_the_Minimum_Cut_and_Maximum_Flow_of_Undirected_Graphs.pdf

Universidade Federal do Paran´a Departamento de Inform´atica Jonatan Schroeder Andr´e Pires Guedes Elias P. Duarte Jr. Computing the Minimum Cut and Maximum Flow of Undirected Graphs Relat´orio T´ecnico RT-DINF 003/2004 Curitiba, PR 2004 Computing the Minimum Cut and Maximum Flow of Undirected Graphs Jonatan Schroeder Andr´e Pires Guedes Elias P. Duarte Jr. Federal University of Paran´a - Dept. of Informatics P.O. Box 19081 CEP 81531-990 Curitiba PR Brazil {jonatan,andre,elias }@inf.ufpr.br Abstract This work presents an algorithm for computing the maximum flow and minimum cut of undirected graphs, based on the well-known algorithm presented by Ford and Fulkerson for directed graphs. The new algorithm is equivalent to just applying Ford and Fulkerson algorithm to the directed graph obtained from original graph but with two directed arcs for each edge in the graph, one in each way. We present a proof of correctness and experimental results. Keywords: Graph Theory, Maximum Flow, Minimum Cut 1 Introduction This work presents an algorithm for computing the maximum flow of undirected graphs. This algorithm differs from those applied to directed graphs (or digraphs), since in undirected graphs an edge can be used in both ways, and if it’s used in a way, it cannot be used in the