-
**Chapter number or note title:** 10. Maximum Flows & MInimum Cuts
**Page number:** 327
**Error description:** footnote is not complete, current text is the following:
> I learned this sto…
-
O(V^2E) で動くよ
## 参考
- https://kkt89.hatenablog.com/entry/2020/03/16/%E6%9C%80%E5%A4%A7%E6%B5%81%E5%95%8F%E9%A1%8C_%E5%8B%89%E5%BC%B7%E3%83%A1%E3%83%A2
- https://topcoder-g-hatena-ne-jp.jag-icpc.or…
-
There is a lot of stuff on npm, but even more big pieces are still missing. Specifically, there still isn't anything good for doing network flow. Ideally, it would be nice to have multiple algorithm…
-
https://levy5307.github.io/blog/pegasus-balancer/
背景介绍
在当前pegasus balancer的实现中，meta server会定期对所有replica server节点的replica情况做评估，当其认为replica在节点分布不均衡时，会将相应replica进行迁移。
在balancer生成决策过程中需要考虑的因素有：
对于…
-
ref Jan 25 office hrs
https://github.com/Agoric/documentation/issues/576#issuecomment-1403994577
seems like I did a little work on it not too long ago... struggled to get the python tests to pass …
dckc updated
6 months ago
-
ex)knight_travel(이미 예전에 추가됨 반복방지) - Brute-force algorithms -Warnsdorff's rule(heuristic)
알고리즘활용한 문제 이름(여기에 추가됨/또는 추가할 사람 이름을 적어서 중복방지) - 알고리즘 이름 - 알고리즘이름2 ....
-
This happens - but only sometimes - on GitHub CI:
```
ford-fulkerson.flix *** FAILED ***
Unable to compile. Failed with: 1 errors.
-- Type Error -----------------------------------------…
-
## Algorithm
> Algoritma konuları için katkıda bulunmak isteyen arkadaşlar repomuzda issue olarak bulunan konulardan birini seçerek hangi konuyu istediğini yorum olarak bildirmesi yeterli. Bunun sebe…
-
The Push-Relabel method is a method to compute the Maximum Flow in a graph. Research has shown that it is both asymptotically and practically faster than several other methods, including Ford-Fulker…
-
## Description
最大流
## Time complexity
ref. https://misawa.github.io/others/flow/dinic_time_complexity.html
- $O(n^2 m)$
- 辺の容量が整数の時
- 流量を $F$ として $O(Fm)$
- 辺の容量の最大値を $k$ として $O(km^{\fr…