The Hungarian algorithm of binary graph matching

Hungarian algorithm, very around, actually write a little bit of length.

BOOL Find (int a) {int i,j;for (I=head[a];i;i=next[i]) {j=to[i];//Gets the adjacent point if (!unable[j]) {//If this point can be matched (reassigned once the previous match was reached) unable[j]=true;//Suppose this time cannot match if (!ub[j] | | | find (UB[J)) {//If you can match ub[j]=a;//set value unable[j]=false;//next time you can return true;//can}}} Return false;//cannot}int Hungary (int n) {int res=0;for (i=0;i<n;++i) {memset (unable,sizeof unable,0);//This is required if (find (i) ) ++res;//If a matching}return res can be found;}

The Hungarian algorithm of binary graph matching