Max Flow Algorithm


 가중치가 있는 방향그래프(directed graph) G와 시작(source) 노드 s, 도착(sink) 노드 t가 주어졌을 때 각 엣지의 용량(capacity)을 고려하여 s에서 t로 흘려보낼 수 있는 최대 유량(flow)을 구하는 알고리즘을 가리킴
### MFA Terms
|Title|
|:-:|
|[cancellation](https://texonom.com/cancellation-ba8fedc1cb8d477f88a0148acd2d1d32)|
|[residual network](https://texonom.com/residual-network-2131e9ec2bc8417e8c0d34b991491009)|
|[augmenting path](https://texonom.com/augmenting-path-ccba03a18a794885aa40c0456fbb8850)|
|[flow](https://texonom.com/flow-ec310298261c44b9bc1f8bd2a29590ae)|
|[capacity](https://texonom.com/capacity-1be259baff2946309d8ccea56ec7356c)|
|[source](https://texonom.com/source-2e4af35b980b4263b01ac1dfbd518d1c)|
|[sink](https://texonom.com/sink-9ac2036f6c0c44ed8f4fc98f09b6afa1)|
|[residual capacity](https://texonom.com/residual-capacity-e98f6510dd4747e6bd4f0de4b22babdd)|

### Ford-Fulkerson Algorithm


> ![](https://www.notion.so/image/https%3A%2F%2Fs3-us-west-2.amazonaws.com%2Fsecure.notion-static.com%2F0c4d0de4-a287-4ccf-8180-b66660291f88%2FUntitled.png?table=block&id=0aa324cb-08be-4393-ab90-f9299b697867&cache=v2)

> 

### edge max bandwidth is static, change direction


### 에드먼드-카프 알고리즘






> [최대 유량 알고리즘 (1)](https://ratsgo.github.io/data%20structure&algorithm/2017/11/29/maxflow/)

> [네트워크 플로우(network flow) & 포드 -풀커슨 &에드먼트-카프 알고리즘 (1)](https://m.blog.naver.com/PostView.nhn?blogId=jh20s&logNo=221298145631&proxyReferer=https%3A%2F%2Fwww.google.com%2F)





