Neorientate - DFS & BFS & Dynamic Allocation

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <queue>

using namespace std;

int N, M, **mat, **vecini;
bool *verificat;
queue < int > Coada;

void DFS(int nod) {
    verificat[nod] = true;
    for(int i = 1; i <= N; i++) {
        int vecin = vecini[nod][i];
        if(vecin != 0 && !verificat[vecin]) {
            cout << vecin << " ";
            DFS(vecin);
        }
    }
}

void BFS(int nod) {
    Coada.push(nod);
    verificat[nod] = true;
    while(!Coada.empty()) {
        int vecin = Coada.front();
        Coada.pop();
        for(int i = 1; i <= N; i++) {
            if(mat[vecin][i] == 1 && !verificat[i]) {
                cout << i << " ";
                Coada.push(i);
                verificat[i] = true;
            }
        }
    }
}

int main() {
    FILE *in = fopen("graph.in", "r");
    fscanf(in, "%d%d", &N, &M);
    mat = new int*[N + 1];
    vecini = new int*[N + 1];
    for(int i = 1; i <= N; i++) mat[i] = new int[N + 1], vecini[i] = new int[N + 1];
    for(int i = 1; i <= N; i++)
        for(int j = 1; j <= N; j++) mat[i][j] = vecini[i][j] = 0;

    while(M--) {
        int x, y;
        fscanf(in, "%d%d", &x, &y);
        mat[x][y] = mat[y][x] = 1;
    }

    cout << endl;
    for(int i = 1; i <= N; i++) {
        for(int j = 1; j <= N; j++) cout << mat[i][j] << " ";
        cout << endl;
    }
    cout << endl;

    for(int i = 1; i <= N; i++) {
        int k = 1;
        for(int j = 1; j <= N; j++) {
            if(mat[i][j]) {
                vecini[i][k] = j;
                k++;
            }
        }
    }
    verificat = new bool[N + 1];
    for(int i = 1; i <= N; i++) verificat[i] = false;
    cout << 1 << " ";
    DFS(1);
    cout << endl;
    for(int i = 1; i <= N; i++) verificat[i] = false;
    cout << 1 << " ";
    BFS(1);
    return 0;
}