【数据结构】SJTU OJ 1233



http://acm.sjtu.edu.cn/OnlineJudge/problem/1233

回溯之后要记得改变状态啊啊啊啊啊啊啊！！！！

记住主要的思想是什么！！

#include <iostream>

using namespace std;
int M,cnt=0;
class graph
{
private:
    struct edgeNode{
        int end;
        edgeNode*next;
        int weight;
        edgeNode(int e,int w,edgeNode*n)
        {
            end= e;weight=w;next =n;
        }
    };
    struct verNode{
        int ver;
        edgeNode *head;
        verNode(edgeNode*h=NULL)
        {
            head = h;
        }
    };
    verNode*verList;
    int vSize,eSize;
public:
    graph(int size){
        vSize =size;
        eSize =0;
        verList = new verNode[size+1];
        for(