Graph Matching
- Prove that a matching M is maximum iff there is no augmenting path.
- Write a report that includes your proof and save it as
quiz10.pdf. Submit your report to https://canvas.emory.edu/courses/32845/assignments/94669
quiz10.pdf. Submit your report to https://canvas.emory.edu/courses/32845/assignments/94669
