一棵树流出的最大流问题C语言

  确定一棵树流出的最大流,即树叶可以流入的最大流量的和,也就是整棵树流出的流量.

  树中每一个非叶节点的流出流量 = min (流入流量, 路径容量).

  知道了这些,自然的方式使用递归,就可求解出该问题.

  很遗憾,我是在看了答案之后才写出的这些.

---

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

---

 当然了,这段代码是自己写的.