一棵樹流出的最大流問題C語言

  確定一棵樹流出的最大流,即樹葉可以流入的最大流量的和,也就是整棵樹流出的流量.

  樹中每一個非分葉節點的流出流量 = min (流入流量, 路徑容量).

  知道了這些,自然的方式使用遞迴,就可求解出該問題.

  很遺憾,我是在看了答案之後才寫出的這些.

/*9-12-12-15-15.53.c -- 第九章第十二題*/<br />/*Pseudocode*/</p><p>FlowType FindMaxFlow (const Tree T, FlowType IncomingFlow) ;</p><p>FlowType FindMaxFlow (const Tree T, FlowType IncomingFlow)<br />{<br />FlowType ChildFlow, TotalFlow ;</p><p>if (IsLeaf (T))<br />return IncomingFlow ;<br />else<br />{<br />TotalFlow = 0 ;<br />for each child Ti of T<br />{<br />/*It is important to make sure that IncomingFlow is the smallest flow between IncomingFlow and ci*/<br />ChildFlow = FindMaxFlow (Ti, min (IncomingFlow, ci)) ;<br />TotalFlow += ChildFlow ;<br />IncomingFlow -= ChildFlow ;<br />}<br />return TotalFlow ;<br />}<br />}

 當然了,這段代碼是自己寫的.