用邻接矩阵创建图

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

#define MaxVertexNum 100 //图的最大节点
#define INFINITY 0xFFFF

typedef int Vertex; //顶点下标
typedef int WeigthType; //边的权值
typedef int DataType; //顶点的数据类型

//边的定义
typedef struct ENode {
	Vertex v1, v2;
	WeigthType weigth;
}*PtrToENode;
typedef PtrToENode Edge;

//图的定义
typedef struct GNode {
	int Nv; //顶点数量
	int Ne; //边的数量
	WeigthType G[MaxVertexNum][MaxVertexNum];//邻接矩阵,存边的权重
	DataType Data[MaxVertexNum];//顶点的数据
}*PtrToGNode;
typedef PtrToGNode MGraph;


//创建一个没有边的图
MGraph CreatGraph(int VertexNum)
{
	Vertex V, W;
	MGraph Graph;

	Graph = (MGraph)malloc(sizeof(struct GNode));
	if (!Graph)
	{
		printf("Graph生成失败");
		exit(-1);
		return NULL;
	}
	Graph->Nv = VertexNum;
	Graph->Ne = 0;

	for ( V = 0; V < Graph->Nv; V++)
	{
		for ( W = 0; W < Graph->Nv; W++)
		{
			Graph->G[V][W] = INFINITY;
		}
	}

	return Graph;
}

//插入边
void InsertEdge(MGraph Graph, Edge E)
{
	Graph->G[E->v1][E->v2] = E->weigth;
	Graph->G[E->v2][E->v1] = E->weigth;
}

//构建一个图
MGraph BuildGraph()
{
	int Nv,i;
	Vertex V;
	Edge E;
	MGraph Graph;

	printf_s("请输入插入节点的个数\n");
	scanf_s("%d",&Nv);

	Graph = CreatGraph(Nv);

	printf_s("请输入插入边的个数\n");
	scanf_s("%d",&(Graph->Ne));
	if (Graph->Ne != 0)
	{
		E = (Edge)malloc(sizeof(struct ENode));
		if (!E)
		{
			printf("E生成失败");
			exit(-1);
			return NULL;
		}
		for ( i = 0; i < Graph->Ne; i++)
		{
			printf("请输入第%d条边:  V1,V2,权重\n",i);
			scanf_s("%d %d %d",&(E->v1), &(E->v2), &(E->weigth));
			InsertEdge(Graph,E);
		}
	}

	for ( V = 0; V < Graph->Nv; V++)
	{
		printf("请输入第%d个顶点的数据\n",V);
		scanf_s("%d",&(Graph->Data[V]));
	}

	return Graph;
}

void main()
{
	printf("无向图\n");
	MGraph Graph;
	Graph = BuildGraph();
}