[QZ#8] Augmenting paths question

emory-courses / dsa-java

Data Structures and Algorithms in Java

https://emory.gitbook.io/dsa-java/

42 stars 55 forks source link

[QZ#8] Augmenting paths question #186

Closed chenda2000 closed 3 years ago

chenda2000 commented 3 years ago

ford-fulkerson-algorithm-1-1024

For this graph, are [S, 1, 3, 2, 3, T] or [S, 2, 3, 2, 4, T] considered augmenting paths? They repeat vertices, but don't repeat edges so I wasn't sure

marvinquiet commented 3 years ago

Hi,

The graph can have cycles but the augmented path should not have cycles.