#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct node
{
int nVertex;
int nEdge;
int *pMatrix;//采用指针动态方法创建,若要写二维数组需用宏
}Graph;
Graph *CreateGraph()
{
Graph *pGraph = NULL;
pGraph = (Graph*)malloc(sizeof(Graph));
printf("请输入顶点个数与边的个数:\n");
int nV,nE;
scanf("%d%d",&nV,&nE);
pGraph->nVertex = nV;
pGraph->nEdge = nE;
//矩阵
pGraph->pMatrix = (int*)malloc(sizeof(int)*nV*nV);
memset(pGraph->pMatrix,0,sizeof(int)*nV*nV);
//放入边
int v1,v2;
int i;
for(i=0;i<nE;i++)
{
printf("请输入一条边:\n");
scanf("%d%d",&v1,&v2);
//确保该点符合范围要求,且该点没有被赋值过
if(v1 != v2 && v1>=1 && v1 <= nV && v2>=1 && v2<=nV && pGraph->pMatrix[(v1-1)*nV+v2-1]==0)
{
pGraph->pMatrix[(v1-1)*nV+v2-1] = 1;
pGraph->pMatrix[(v2-1)*nV+v1-1] = 1;
}
else
{
i--;
}
}
return pGraph;
}
int main()
{
Graph *pGraph = CreateGraph();
int i;
for(i=0;i<(pGraph->nVertex)*(pGraph->nVertex);i++)
{
if(i%pGraph->nVertex == 0)
{
printf("\n");
}
printf("%d",pGraph->pMatrix[i]);
}
return 0;
}