Maximum Bipartite Matching

//{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;

// } Driver Code Ends
class Solution {
public:
	    vector<int>match;

vector<int>vis;

  bool solve(int p,vector<vector<int>>&g){

      for(int j=0;j<g[0].size();j++){

          if(g[p][j] && !vis[j]){

              vis[j]=1;

              if(match[j]==-1 || solve(match[j],g)){

                  match[j]=p;

                  return true;

              }

          }

      }

      return false;

  }

 int maximumMatch(vector<vector<int>>&g){

     int p=g.size();

     int j=g[0].size();

     match=vector<int>(j,-1);

     int ans=0;

     for(int i=0;i<p;i++){

         vis=vector<int>(j,0);

         if(solve(i,g))ans++;

     }

     return ans;

	}

};

//{ Driver Code Starts.
int main(){
	int tc;
	cin >> tc;
	while(tc--){
		int m, n;
		cin >> m >> n;
		vector<vector<int>>G(m, vector<int>(n, 0));
		for(int i = 0; i < m; i++){
			for(int j = 0; j < n; j++)
				cin >> G[i][j];
		}
		Solution obj;
		int ans = obj.maximumMatch(G);
		cout << ans << "\n";    
	}
	return 0;
}
// } Driver Code Ends