Maximum s-t Flow: Ford–Fulkerson Algorithm (Augmenting Path Algorithm). Maximum s-t Flow: Edmonds–Karp Algorithm (Shortest Augmenting Path Algorithm).
確定! 回上一頁