C++中申请动态二维数组不当造成程序异常退出的问题

开门见山

#include "Graph.h"
#include <Vertex.h>
#include <Edge.h>
#include <time.h>
#include <cstdlib>
#include <cstddef>
#include <fstream>
#include <string>
using namespace std;
void Graph::randGene_directed(const int &nbNodes){
srand (time(NULL)+1);
    for(int i=0; i<nbNodes;i++){//initialize all the nodes/Vertexes and give them a color
        Vertex *v = new Vertex(i);// to initialize
        v->color = 0; //O black & 1 white
        listVertex.push_back(v);
    }

    int p=0;//index of the edges
    for(int i=0; i<nbNodes;i++){//to create the matrix
        for(int j=0; j<nbNodes;j++){
            int index =rand() % 2;//generate an random number between 0,1
            int weight=rand() % 100+1;
            if(index == 1){//if an edge exist
                Edge *e = new Edge(p, listVertex[i],listVertex[j],weight);
                matrix[i][j]=weight;
                p++;
                listEdges.push_back(e);
            }
        }
    }

}
void Graph::randGene_undirected(const int &nbNodes){
srand (time(NULL)+1);
    for(int i=0; i<nbNodes;i++){//initialize all the nodes/Vertexes and give them a color
        Vertex *v = new Vertex(i);// to initialize
        v->color = 0; //O black & 1 white
        listVertex.push_back(v);
    }
    int p=0;//index of the edges
    for(int i=0; i<nbNodes;i++){//to create the matrix
        for(int j=0; j<nbNodes;j++){
            int index =rand() % 2;//generate an random number between 0,1
            int weight=rand() % 100+1;
            if(index == 1){//if an edge exist
                Edge *e = new Edge(p, listVertex[i],listVertex[j],weight);
                p++;
                listEdges.push_back(e);
            }
        }
    }
}
Graph::Graph(int nbNodes)//construction of a directed graph with a randomly generated matrix
{
    matrix=new int*[nbNodes];
    for(int i=0;i<nbNodes;i++){
        *matrix=new int[nbNodes];
    }

    for(int x=0; x<nbNodes;x++){
            for(int y=0; y<nbNodes;y++){
                printf("
line %d column %d
%d",x,y,matrix[x][y]);
            }
    }

    randGene_directed(nbNodes);
    printf("test");
 for(int x=0; x<nbNodes;x++){
            for(int y=0; y<nbNodes;y++){
               printf("%d
",matrix[x][y]);
            }
    }
}
Graph::Graph(ifstream * of){
    string line,lines[3];
    //char ch[3];
    int i=0,Nb_Vertices=0;
    while(getline(*of,line)){
        lines[i]=line;
        if(i++>=3){
            printf("error:lines exceeded");
            return;
        }
    }
    if(Nb_Vertices=stoi(lines[0],NULL,0)<=0){
        printf("error:invalid vertex number");
        return;
        }
    if(lines[1]!="o"&&lines[1]!="n"){
        printf("error:invalid graph type");
        return;
        }
    if(lines[2]!="m"&&lines[2]!="l"){
        printf("error:invalid graph representation");
        return;
        }
    if(lines[1]=="o"){
        if(lines[2]=="l"){
           // Graph::Graph(Nb_Vertices);
        }
    }




}

Graph::~Graph()
{
    for(int i=0;i<listVertex.size();i++)
        delete[] matrix[i];
    delete[] matrix;
}

void Graph::display(bool typeOfGraph,bool typeOfRepresentation){
    ofstream myFeed("Files/Result.txt");//supprime l'ancien fichier ou en créé un nouveau
    //display the number of vertexes
    cout<<listVertex.size()<<endl;
    myFeed<<listVertex.size()<<endl;
    if(typeOfGraph){//Type of graph : directed graph
        cout<<"o"<<endl;
        myFeed<<"o"<<endl;
    }else{//Type of graph : undirected graph
        cout<<"n"<<endl;
        myFeed<<"n"<<endl;
    }
    if(typeOfRepresentation){//type of representation : matrix
        cout<<"m"<<endl;
        myFeed<<"m"<<endl;
        displayMatrix();
    }else{//type of representation : list
        cout<<"l"<<endl;
        myFeed<<"l"<<endl;
        displayList();
    }
}

void Graph::displayMatrix(){
   /// int matrix[listVertex.size()][listVertex.size()];
    ofstream myFeed("Files/Result.txt", ios::app);

    //calculation of the matrix


    if(myFeed){
        //display
        for(int x=0; x<listVertex.size();x++){
                for(int y=0; y<listVertex.size();y++){
                    myFeed<<matrix[x][y]<<";";
                    cout<<matrix[x][y]<<";";
                }
                myFeed<<endl;
                cout<<endl;
        }
    }else{
    cout<<"ERROR .TXT"<<endl;
    }
}

代码有点长····主要就是数据结构中图的实现。主要看55-58行，上述程序运行后发生异常退出，如下图

 关闭窗口，build log出现Process terminated with status -1073741510

参考1：https://www.xuebuyuan.com/1149254.html

参考2：http://www.it1352.com/494518.html

最终发现是申请二维动态数组时的语法错误，55-58行应该改成：

matrix=new int*[nbNodes];
    for(int i=0;i<nbNodes;i++){
        matrix[i]=new int[nbNodes];
    }

好吧，好久不写代码很多基础知识都混乱了。