邻接矩阵法实现图的创建和输出

#include<stdio.h>
#include <stdlib.h>  
#include<assert.h>
#include<string.h>
#include<stdbool.h>
#define MAX 100
typedef struct Graph
{
	int arcnum;//定义边数
	int vexnum;//定义顶点数
	char vertex[MAX][20];//用字符串来存储顶点
	int matrix[MAX][MAX];//定义矩阵来存储
	//无权图：0不连通，1连通
	//带权图：填充权值
	//无向图：要做两次填充，v1-v2,v2-v1
}Graph;
//获取给出字符（串）其所在顶点集(数组)的下标
int get_pos(Graph* g, const char* v)
{
	for (int i = 0; i < g->vexnum; i++)
	{
		if (strcmp(g->vertex[i], v) == 0)
		{
			return i;
		}
	}
	return -1;
}


void CreateGraph(Graph*& g)
{
    g = (Graph*)malloc(sizeof(Graph));
	assert(g);//判断是否成功开辟空间
	printf("请分别输入边数和顶点数（用逗号间隔）：");
	scanf_s("%d,%d",&g->arcnum,&g->vexnum);
	printf("请依次输入顶点(用空格间隔)：");
	for (int i = 0; i < g->vexnum; i++)
	{
		scanf_s("%s",g->vertex[i],20);
	}
	char v1[20] = "";
	char v2[20] = "";
	int weight = 0;//定义权值
	int i = 0, j = 0;
	//先对邻接矩阵进行初始化
	for (i = 0; i < g->vexnum; i++)
	{
		for (j = 0; j < g->vexnum; j++)
		{
			g->matrix[i][j] = 0;
		}
	}
	//控制输入边的操作
	for (int k = 0; k < g->arcnum; k++)
	{
		printf("请输入第%d条边的信息（用顶点加空格加顶点加空格加权值的方式输入，比如A B 10）：",k+1);
		scanf_s("%s%s%d",v1,20,v2,20,&weight);
		i = get_pos(g, v1);
		j = get_pos(g, v2);
		if (i == -1 || j == -1)
		{
			printf("边输入有误!\n");
			k--;//边输入有误的话则k减一，倒回去继续输入
			continue;
		}
		g->matrix[i][j] = weight;
		//如果是无向图的话则再做一次填充
		//g->matrix[j][i]=weight;
	}
}
//输出图的邻接矩阵
void PrintGraph(Graph* g)
{
	for (int i = 0; i < g->vexnum; i++)
	{
		printf("\t%s",g->vertex[i]);
	}
	printf("\n");
	for (int i = 0; i < g->vexnum; i++)
	{
		printf("%s\t",g->vertex[i]);
		for (int j = 0; j < g->vexnum; j++)
		{
			printf("%d\t",g->matrix[i][j]);
		}
		printf("\n");
	}
}
void DestroyGraph(Graph* g)
{
	free(g);
}
int main(int argc, char* argv[])
{
	Graph* g;
	CreateGraph(g);
	PrintGraph(g);
	DestroyGraph(g);
	return 0;
}