图

#include <stdio.h>
#define MaxVertices 100
#define MaxWeight 32767
typedef struct{
	int Vertices[MaxVertices];
	int Edge[MaxVertices][MaxVertices];
	int numV;
	int numE;
}AdjMatrix;
void CreateGraph(AdjMatrix *G,int n , int e);
void DispGraph(AdjMatrix G);
int main(){
	AdjMatrix *G;
	CreateGraph(G,4,5);
	//DispGraph(*G);
	return 0;
}
void CreateGraph(AdjMatrix *G,int n , int e){
	int i , vi , vj , w;
	G ->numE = e;
	G ->numV = n;
	printf("  输入顶点的信息（整型）：");
	for(i = 0; i <G->numV ; i ++){
		printf("\n%d",i+1);
		scanf("%d",&G->Vertices[i]);
	}
	for(i = 0; i < G->numE ; i ++){
		printf("\n %输入边度信息（vi,vj,w）:");
		scanf("%d %d %d",&vi,&vj,&w);
		G ->Edge[vi-1][vj-1]=w;
		G ->Edge[vj-1][vi-1]=w; 
	}
}
void DispGraph(AdjMatrix G){
	int i ;
	printf("\n 输出顶点的信息（整型）：\n");
	for(i = 0 ; i < G.numV ; i ++) printf("%d",G.Vertices[i]," ");
	printf("\n输入出邻接矩阵 ：\n ");
	for(i = 0;i < G.numV ; i ++){
		printf("\n %d",i + 1);
		for(int j = 0 ; j < G.numV; j ++)
		printf("%d" ,G.Edge[i][j]," ");
		printf("\n");
	}
}