- 1、本文档共16页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
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
文档评论(0)