We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
https://oi-wiki.org/graph/flow/max-flow/#%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6%E5%88%86%E6%9E%90_1
最大流 Dinic 算法中「层次图层数单调性的证明」中
我们给高度标号一个不严格的临时定义——在网络 $G = (V, E)$ 上,令 $h$ 是点集 $V$ 到整数集 $N$ 上的函数,$h$ 是 $G$ 上合法的高度标号当且仅当 $d(u) \leq d(v) + 1$ 对于 $(u, v) \in E$ 恒成立。
此处的 $d(u) \leq d(v) + 1$ 应为 $h(u) \leq h(v) + 1$。
The text was updated successfully, but these errors were encountered:
Successfully merging a pull request may close this issue.
请选择:
我正在访问这个页面
https://oi-wiki.org/graph/flow/max-flow/#%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6%E5%88%86%E6%9E%90_1
我发现页面有这样的问题
最大流 Dinic 算法中「层次图层数单调性的证明」中
我们给高度标号一个不严格的临时定义——在网络$G = (V, E)$ 上,令 $h$ 是点集 $V$ 到整数集 $N$ 上的函数,$h$ 是 $G$ 上合法的高度标号当且仅当 $d(u) \leq d(v) + 1$ 对于 $(u, v) \in E$ 恒成立。
此处的$d(u) \leq d(v) + 1$ 应为 $h(u) \leq h(v) + 1$ 。
The text was updated successfully, but these errors were encountered: