图的邻接矩阵表示

最新推荐文章于 2022-07-11 16:02:17 发布

路漫漫之大神之养成

最新推荐文章于 2022-07-11 16:02:17 发布

阅读量647

点赞数

分类专栏：数据结构图文章标签：图

本文链接：https://blog.csdn.net/wan767912626/article/details/51068628

版权

# include <stdio.h>
# include <malloc.h>
# include <memory.h>
# define MAX 10				//最大顶点数 

typedef struct
{
	char vexs[MAX];		//顶点向量 
	int arcs[MAX][MAX];	//邻接矩阵 
	int vexnum,arcnum;	//图的当前点数和弧数 
}MGRAPH,* mgraph;

void init_mgraph(mgraph &g)		//初始化图 
{
	int i;
	g = (mgraph)malloc(sizeof(MGRAPH));
	g->vexnum = 0;
	g->arcnum = 0;
	memset(g->vexs,0,sizeof(char)*MAX);
	for (i=0;i<MAX;++i)
	{
		for (int j=0;j<MAX;++j)
		{
			g->arcs[i][j] = 0;
		}
	}
}

void add_vexs(mgraph &g)		//增加顶点 
{
	printf ("请输入顶点的个数\n");
	scanf ("%d",&(g->vexnum));
	printf ("请输入顶点的值\n");
	for (int i=0; i<g->vexnum; ++i)
	{
		scanf ("%d",&(g->vexs[i]));
	}
}

void add_arcs(mgraph &g)	//增加边 
{
	printf ("请输入边的个数\n");
	scanf ("%d",&(g->arcnum));
	char ch1,ch2;
	int row,col;
	
	for (int i=0;i<g->arcnum;+