从源到接收器的顶点不相交路径的最大数量 [英] the maximum number of vertex-disjoint paths from source to sink

问题描述

需要一个想法来编写一个程序，用于查找从源到目标的最大数量的顶点不相交路径。据我所知，Ford-Fulkerson算法可以用于相同的。但是，需要知道一个具体的想法。谢谢....

Need an idea to write a program for finding maximum number of vertex-disjoint paths from a source to target. As far as I think, Ford-Fulkerson algorithm can be used for the same. However, need to know a concrete idea for the same. Thanks ....

推荐答案

请参阅 https ：//www.google.com/search？q = Ford-Fulkerson +算法 [ ^ ]。

这篇关于从源到接收器的顶点不相交路径的最大数量的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！