Algorithm to find Matching

• Follow any path in the matching graph starting at (m,n).

• The path will end up at (0,0).

• Output each pair (i,j) visited to make a list of pairs forming a matching path.

Previous slide

Next slide

Back to first slide

View graphic version