二分图最大匹配

#include <iostream>
#include <queue>
#include <vector>
#include <stdio.h>
using namespace std;

class B_Graph
{
private:
    struct vertex
    {
        bool flag; //是否被标记
        int ver;   //标记的顶点
        vector<int> adj;
        vertex(bool f = 0, int v = 0) : flag(f), ver(v) {}
    };
    struct Matching
    {
        int ww;
        int uu;
        Matching(int w = 0, int u = 0) : ww(w), uu(u) {}
        void print()
        {
        }
    };
    int N1, N2; //点数，N1为V，N2为U
    vector<vertex> V;
    vector<Matching> M;

public:
    B_Graph(int n1, int n2) : N1(n1), N2(n2)
    {
        vertex tmp;
        Matching tmp1;
        for (int i = 0; i <= N1 + N2; i++)
            V.push_back(tmp);
        for (int i = 0; i <= N1; i++)
            M.push_back(tmp1);
    }
    void merge(int i, int j)
    {
        V[i].adj.push_back(j);
    }
    void Max_B_Maching()
    {
        queue<int> Q;
        int i1 = 0;
        while (i1++ < N1)
            Q.push(i1);
        while (!Q.empty())
        {
            int w = Q.front();
            Q.pop();
            if (w <= N1) //即w属于V
            {
                for (unsigned int i = 0; i < V[w].adj.size(); i++)
                {
                    int u = V[w].adj[i];
                    if (V[u].flag == 0)
                    {
                        Matching tmp(w, u);
                        M[w] = tmp;
                        V[u].flag = 1;
                        V[w].flag = 1;
                        int v = w;
                        while (V[v].ver)
                        {
                            u = V[v].ver;
                            v = V[u].ver;
                            Matching tmp2(v, u);
                            M[v] = tmp2;
                            V[v].flag = 1;
                        }
                        for (int i = 1; i <= N1 + N2; i++)
                            V[i].ver = 0;
                        while (!Q.empty())
                            Q.pop();
                        for (int i = 1; i <= N1; i++)
                            if (V[i].flag == 0)
                                Q.push(i);
                        break;
                    }
                    else
                    {
                        if ((M[w].ww != w || M[w].uu != u) && V[u].ver == 0)
                        {
                            V[u].ver = w;
                            Q.push(u);
                        }
                    }
                }
            }
            else
            {
                int i = 1;
                for (; i <= N1; i++)
                    if (M[i].uu == w)
                    {
                        V[i].ver = w;
                        break;
                    }
                Q.push(i);
            }
        }
    }
    void print_M_maching()
    {
        for (int i = 1; i <= N1; i++)
            if (M[i].ww != 0)
                M[i].print();
    }
    int max_maching()
    {
        int Max = 0;
        for (int i = 1; i <= N1; i++)
            if (M[i].ww != 0)
                Max++;
        return Max;
    }
};

vector<int> mp[1021];

vector<int> l, r;  //二分图两个集合  

void dfs(int x, int k)
{
    if (k % 2)
        l.push_back(x);
    else
        r.push_back(x);
    for (int i = 0; i < mp[x].size(); i++)
    {
        dfs(mp[x][i], k + 1);
    }
}
int main()
{
    int n;
    cin >> n;
    for (int i = 2; i <= n; i++)
    {
        int x;
        cin >> x;
        mp[x].push_back(i);
    }
    dfs(1, 1);
    int v = l.size(), u = r.size(), edge = n - 1;
    B_Graph G(u, v);
    int a, b;
    while (edge--)  //变
    {
        for (int i = 1; i <= n; ++i)
        {
            for (int j = 0; j < mp[i].size(); j++)
            {

                G.merge(i, mp[i][j]);
            }
        }
    }
    G.Max_B_Maching();
    G.print_M_maching();
    cout << G.max_maching() << endl;
    return 0;
}