33,008
社区成员
发帖
与我相关
我的任务
分享请教算法导论（二版）有关极大流（26章）的问题，即习题26.4-7
26.4-7
Let δf (u, v) be the distance (number of edges) from u to v in the residual network Gf. Show that GENERIC-PUSH-RELABEL maintains the properties that h[u] < |V| implies h[u] ≤ δf(u, t) and that h[u] ≥ |V| implies h[u] -|V| ≤ δf(u, s).
搞不清楚，跪求各位帮助解答，不胜感激！！
Let δf (u, v) be the distance (number of edges) from u to v in the residual network Gf. Show that GENERIC-PUSH-RELABEL maintains the properties that h[u] < |V| implies h[u] ≤ δf(u, t) and that h[u] ≥ |V| implies h[u] -|V| ≤ δf(u, s).
搞不清楚，跪求各位帮助解答，不胜感激！！
...全文
请发表友善的回复…
发表回复
longdouhzt 2011-08-14
- 打赏
- 举报
设 u 到 t 的最短路径为 v0 v1 .... vk
v0 = u, vk = t
则 δf(u, t) = k
利用h的定义 h[v0] <= h[v1] + 1 <= .. <= h[vk] + k = h[t] + k = k = δf(u, t)
后面那个一样证法
v0 = u, vk = t
则 δf(u, t) = k
利用h的定义 h[v0] <= h[v1] + 1 <= .. <= h[vk] + k = h[t] + k = k = δf(u, t)
后面那个一样证法
wycl16514 2008-04-11
- 打赏
- 举报
不好意思，题目有错，再写一遍
Let δf (u, v) be the distance (number of edges) from u to v in the residual network Gf. Show that GENERIC-PUSH-RELABEL maintains the properties that h[u] < |V| implies h[u] ≤ δf(u, t) and that h[u] ≥ |V| implies h[u] -|V| ≤ δf(u, s).
Let δf (u, v) be the distance (number of edges) from u to v in the residual network Gf. Show that GENERIC-PUSH-RELABEL maintains the properties that h[u] < |V| implies h[u] ≤ δf(u, t) and that h[u] ≥ |V| implies h[u] -|V| ≤ δf(u, s).
