Maximum Cardinality Bipartite Matching: Augmenting Path Algorithm

http://www.csie.ntnu.edu.tw/~u91029/Matching.html

 int nx,ny;
 int mx[N],my[N];
 bool vy[N];
 bool g[N][N];

 int decode(int x,int y)   {return x*+y;}

 bool dfs(int x)
 {
     for(int y=;y<ny;++y)
         if(g[x][y] && !vy[y])
         {
             vy[y]=;
             if(my[y]==- || dfs(my[y]))
             {
                 mx[x]=y;
                 my[y]=x;
                 return ;
             }
         }
     return ;
 }

 int b_matching()
 {
     memset(mx,-,sizeof(mx));
     memset(my,-,sizeof(my));
     int c=;
     for(int x=;x<nx;++x)
     {
         memset(vy,,sizeof(vy));
         if(dfs(x))  ++c;
     }
     return c;
 }