dfs自测

#include <iostream>
#include <vector>
using namespace std;
int cmax, N, sp, M, num;   int a, b, c;  int sum;

int cnt = 0;
void dfs(int index,int** road, bool *visit)
{
    for (int i = 1; i < N; i++)
    {
        if (road[index][i]>0 && visit[i] == false)
        {
            cout << index<<"-->"<<i<<endl;
            visit[i] = true;
            dfs(i, road, visit);
            visit[i] = false;
            if (i == 7)cnt++;
        }
    }
}



int main() {
    //输入和初始化操作
    cin >> cmax >> N >> sp >> M;
    N++;
    int *bike = new int[N]();//此时不能用fill进行填充，需要进行初始化，否则delete会报错
    bool *visit = new bool[N]();
    int **road = new int*[M]();
    for (int i = 0; i < M; i++)
    {
        road[i] = new int[M]();
    }
    //fill(bike, bike+N, 0);
    //fill(visit, visit+N, false);
    //fill(road[0], road[0]+M*M, 0);
    for (int i = 1; i <N; i++)
    {
        cin >> num;
        bike[i]=num;
    }
    for (int i = 0; i < M; i++)
    {
        cin >> a >> b >> c;
        road[a][b] =road[b][a] = c;
    }

    //深度优先搜索
    dfs(0, road, visit);
    cout <<"*****"<< cnt << endl;
    //删除操作
    system("pause");

    delete[] bike;
    delete[] visit;
    for (int i = 0; i < M; i++)
    {
        delete[] road[i];
    }
    delete[] road;
    return 0;
}

测试数据：
10 8 3 9
6 7 0 1 2 3 4 5
0 1 1
1 4 1
4 7 1
0 2 1
2 5 1
5 7 1
0 3 1
3 6 1
6 8 1