Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| courses:cs211:winter2018:journals:holmesr:section_7.5 [2018/04/04 02:25] – holmesr | courses:cs211:winter2018:journals:holmesr:section_7.5 [2018/04/04 03:22] (current) – holmesr | ||
|---|---|---|---|
| Line 18: | Line 18: | ||
| The section goes on to discuss what should happen in the case that there is not perfect matching in the bipartite graph. It would be good to produce an output that convinces the user that there is no perfect matching. The maximum flow of G' must be at least n to allow for a perfect matching. | The section goes on to discuss what should happen in the case that there is not perfect matching in the bipartite graph. It would be good to produce an output that convinces the user that there is no perfect matching. The maximum flow of G' must be at least n to allow for a perfect matching. | ||
| + | |||
| + | Nothing I am reading in this chapter makes any sense. | ||
