## See also

Berge's Theorem,

Blossom Algorithm,

Hungarian Maximum
Matching Algorithm
## Explore with Wolfram|Alpha

## References

Ford, L. R. and Fulkerson, D. R. *Flows in Networks.* Princeton, NJ: Princeton University Press, 1962.Skiena,
S. *Implementing
Discrete Mathematics: Combinatorics and Graph Theory with Mathematica.* Reading,
MA: Addison-Wesley, 1990.## Referenced on Wolfram|Alpha

Augmenting Path
## Cite this as:

Weisstein, Eric W. "Augmenting Path."
From *MathWorld*--A Wolfram Web Resource. https://mathworld.wolfram.com/AugmentingPath.html

## Subject classifications