Lab 6.3 Maximum Bipartite Matching
You cannot submit for this problem because the homework's deadline is due.
Description
Implement an algorithm that solves the Maximum Biparitite Matching.
Format
Submit a tar or zip file including a script named maxMatching.ml
or maxMatching.py
.
The input graph is an unweighted, undirected bipartite graph.
Input
First line is the number of vertices n
.
Second line is the numer of edges m
.
Following lines are the edges.
Output
The number of maximum matching.