浅析数据结构-图的基本概念

#include <iostream>
#include "GraphData.h"
using namespace std;
//

void PrintGrgph(GraphList *pGraphList)
{
int i =0;
while(pGraphList->vertexList[i].pFirstNode != NULL && i<MAXVEX)
{
printf("顶点:%c  ",pGraphList->vertexList[i].nNodeData);
EdgeNode *e = NULL;
e = pGraphList->vertexList[i].pFirstNode;
while(e != NULL)
{
printf("%d  ", e->nNodevex);
e = e->next;
}
i++;
printf("\n");
}

}
int main()
{
int numVexs,numEdges;
GraphData* pTestGraph = new GraphData();
GraphArray graphArray;
GraphArray* pGraphArray = &graphArray;
GraphList* pGgraphList = new GraphList();

cout<<"输入顶点数和边数"<<endl;
cin>>numVexs>>numEdges;
cout<<"顶点数和边数为："<<numVexs<<numEdges<<endl;

/*pTestGraph->CreateGraphArray(pGraphArray,numVexs,numEdges);
for(int i = 0; i< numEdges;i++)
{
for (int j = 0;j< numEdges;j++)
{
cout<<pGraphArray->arg[i][j];
}
cout<<endl;
}*/
pTestGraph->CreateGraphList(pGgraphList,numVexs,numEdges);
PrintGrgph(pGgraphList);
system("pause");
}