Replies: 12 comments
-
|
类 Dinic 算法和 mcmf 算法的代码放反了？ |
Beta Was this translation helpful? Give feedback.
-
|
第一个算法不是叫SSP(Successive Shortest Path)吗……MCMF是min cost max flow的缩写啊 |
Beta Was this translation helpful? Give feedback.
-
|
@s0cks5 如果有时间，可以开个pr帮忙修正 |
Beta Was this translation helpful? Give feedback.
-
|
Primal-Dual 可以在搜增广路的同时更新势吗 |
Beta Was this translation helpful? Give feedback.
-
|
建议添加 "基于 Capacity Scaling 的弱多项式复杂度最小费用流算法" |
Beta Was this translation helpful? Give feedback.
-
|
Primal-Dual 算法的复杂度是多少啊QwQ |
Beta Was this translation helpful? Give feedback.
-
|
建议添加“模拟费用流” |
Beta Was this translation helpful? Give feedback.
-
|
我觉得可以稍微讲一下zkw费用流？ |
Beta Was this translation helpful? Give feedback.
-
|
建议添加带负圈的费用流 |
Beta Was this translation helpful? Give feedback.
-
|
可以增加模拟费用流吧 |
Beta Was this translation helpful? Give feedback.
-
|
SSP有基于ISAP的实现嘛 |
Beta Was this translation helpful? Give feedback.
-
|
建议添加单纯形网络流 |
Beta Was this translation helpful? Give feedback.
-
https://oi-wiki.org/graph/flow/min-cost/
Beta Was this translation helpful? Give feedback.
All reactions