最小权顶点覆盖问题

#include <iostream>
#include <fstream>
#include <queue>
#include <algorithm>
using namespace std;

const int MAX = 50;
int G[MAX][MAX];
int bestx[MAX];
int w[MAX];     //顶点的权
int n, e; //电路板数，连接块数

class Node
{
public:
    int dep;  //当前层
    int val;  //所含顶点权值之和
    int *x;   //解向量
    int *c;   //边上的另一个顶点

    Node()
    {
        x = new int[n+1];
        c = new int[n+1];
    }

    //当前排列长度小的先出队列
    bool operator < (const Node &node) const
    {
        return val >= node.val;
    }
};

priority_queue<Node> q;

//判断图是否已完全覆盖
bool cover(Node E)
{
    for(int i=1; i<=n; i++)
        if(E.x[i]==0 && E.c[i]==0)
            return false;
    return true;
}

//添加结点
void addNode(Node enode, int i, int v, bool isLeft)
{
    Node now;
    now.dep = i;
    copy(enode.x, enode.x+n+1, now.x);
    copy(enode.c, enode.c+n+1, now.c);
    if(isLeft)
    {
        now.val = v + w[i]; 
        now.x[i] = 1;
        for(int j=1; j<=n; j++)
            if(G[j][i])
                now.c[j]++;
    }
    else
    {
        now.val = v;
        now.x[i] = 0;
    }
    q.push(now);
}

int search()
{
    Node enode;
    for(int j=1; j<=n; j++)
    {
        enode.x[j] = 0;
        enode.c[j] = 0;
    }
    int best;
    int i = 1;
    int val = 0;
    while(true)
    {
        if(i>n)
        {
            if(cover(enode))
            {
                best = val;
                copy(enode.x, enode.x+n+1, bestx);
                break;
            }
        }
        else
        {
            if(!cover(enode))
                addNode(enode, i, val, true);
            addNode(enode, i, val, false);
        }
        if(q.empty())
            break;
        else
        {
            enode = q.top();
            q.pop();
            i = enode.dep + 1; 
            val = enode.val; 
        }
    }
    return best;
}

int main()
{
    ifstream fin("顶点覆盖.txt");
    cout << "输入图的顶点数：";
    fin >> n; cout << n;
    cout << "\n输入图的边数：";
    fin  >> e; cout << e;
    cout << "\n输入顶点的权：\n";
    int i; 
    for(i=1; i<=n; i++)
    {
        fin >> w[i];
        cout << w[i] << " ";
    }
    cout << "\n输入每条边：\n";
    int a, b;
    memset(G, 0, sizeof(G));
    for(i=1; i<=e; i++)
    {
        fin >> a >> b;
        G[a][b] = G[b][a] = 1;
        cout << a << " " << b << endl;
    }

    cout << "\n最小顶点覆盖权之和为：" << search();
    cout << "\n最优解为：\n" ;
    for(i=1; i<=n; i++)
        cout << bestx[i] << " ";

    cout << endl;
    cout << endl;
    fin.close();
    return 0;
}