IA adancime limitata

int adancimeLimitata(int start, int stop, int A[20][20], char *nume[20], int limita) {

    int nrNoduri = 0, contorViz = 0;

    int noduri[20];//orasele in asteptare
    int viz[20];//orase deja vizitate
    int parinte[20];//parinte[i]=j =>j este parintele lui i
    int gasit = 0;
    for (int i = 0; i < 20; i++)
        viz[i] = 0;
    viz[start] = 1;
    noduri[0] = start;
    nrNoduri++;
    int contorpas = 0;

    cout << "Pasul " << contorpas++ << ": ";
    for (int i = 0; i < nrNoduri; i++)
        cout << nume[noduri[i]] << " ";
    cout << endl;
    int adancime[20];
    adancime[start]=0;


    while (gasit == 0 && nrNoduri > 0) {
        int nod = noduri[0];
        for (int i = 0; i < nrNoduri - 1; i++)
            noduri[i] = noduri[i + 1];
        nrNoduri--;
        if (nod == stop)
            gasit = 1;
        else
            for (int i = 0; i<20; i++)
                if ((A[nod][i] != 0) && (viz[i] == 0) && adancime[nod]<limita-1) {
                    for (int j = nrNoduri-1; j >= 0; j--)
                        noduri[j+1] = noduri[j];
                    nrNoduri++;
                    noduri[0] = i;
                    viz[i] = 1;
                    parinte[i] = nod;
                    adancime[i]=adancime[nod]+1;
                }
        cout << "Pasul " << contorpas++ << ": ";
        for (int i = 0; i < nrNoduri; i++) {
            cout << nume[noduri[i]] << " ";
        }
        cout << endl;
    }

    if(gasit) {
        cout << endl;
        int temp = stop;
        int contorTraseu = 0;
        int traseu[20];
        while (parinte[temp] != start) {
            traseu[contorTraseu++] = temp;
            temp = parinte[temp];
        }
        traseu[contorTraseu++] = temp;
        traseu[contorTraseu++] = parinte[temp];
        for (int i = contorTraseu - 1; i >= 0; i--) {
            cout<<nume[traseu[i]]<<" "<<adancime[traseu[i]] <<", ";
        }
    } else
        cout<<"nu  s-a gasit drum de la  "<<nume[start]<<" la  " <<nume[stop]<<"cu limita  "<<limita<<endl;
    return 0;
}

int H[20];
int CreareMatrice(int A[20][20]) {

    A[0][1] = 75;
    A[1][0] = 75;

    A[0][2] = 140;
    A[2][0] = 140;

    A[0][3] = 118;
    A[3][0] = 118;

    A[1][4] = 71;
    A[4][1] = 71;

    A[4][2] = 151;
    A[2][4] = 151;

    A[3][7] = 111;
    A[7][3] = 111;

    A[7][10] = 70;
    A[10][7] = 70;

    A[10][11] = 75;
    A[11][10] = 75;

    A[11][12] = 120;
    A[12][11] = 120;

    A[2][5] = 99;
    A[5][2] = 99;

    A[2][6] = 80;
    A[6][2] = 80;

    A[6][12] = 146;
    A[12][6] = 146;

    A[6][9] = 97;
    A[9][6] = 97;

    A[12][9] = 138;
    A[9][12] = 138;

    A[5][8] = 211;
    A[8][5] = 211;

    A[9][8] = 101;
    A[8][9] = 101;

    A[8][13] = 90;
    A[13][8] = 90;

    A[8][14] = 85;
    A[14][8] = 85;

    A[14][15] = 98;
    A[15][14] = 98;

    A[15][16] = 86;
    A[16][15] = 86;

    A[14][17] = 142;
    A[17][14] = 142;

    A[17][18] = 92;
    A[18][17] = 92;

    A[18][19] = 87;
    A[19][18] = 87;


    return 0;
}

int main() {
    char *nume[20] = { "Arad", "Zerind", "Sibiu", "Timisoara", "Oradea", "Fagaras", "Ramnicu Valcea", "Lugoj", "Bucuresti", "Pitesti", "Mehadia", "Drobeta", "Craiova", "Giurgiu", "Urziceni", "Hirsova", "Eforie", "Vaslui", "Iasi", "Neamt" };
    //                   0         1        2          3          4          5              6            7          8           9         10          11        12         13         14          15         16        17       18      19
    for(int i=0; i<20; i++)}
        for(j=0; j<20; j++){
            A[i][j]=0;
        }
        }


    CreareMatrice(A);
    for(int i=0;i<20;i++){
        for(int j=i+1;j<20;j++){
            if(A[i][j]!=0){
                printf("%5d%5d%5d\n",i,j,A[i][j]);
            }
        }
    }
    cout<<"-----------"<<endl;
    CreareVector(H);
    int start = 0, stop = 8;
    cout << endl << endl<< "Cautare in adancime limitata:" << endl;
    adancimeLimitata(start,stop,A,nume,4);

    _getch();
    return 0;
}