图的邻接矩阵算法----（附完整调试代码）

包含：

1.图的邻接矩阵的数据结构

2.图的初始化

3.图的创建

4.图的邻接矩阵的广度优先遍历算法

 

完整程序调试代码：

#include<stdio.h>
#include<stdlib.h>
#define MaxVertexNum 100
#define INFINITY  65535
//#define MaxSize 10
typedef int Vertex;
typedef int WeightType;
typedef char DataType;

//图的数据结构 
typedef struct GNode * PtrToGNode;
struct GNode{
	int Nv;
	int Ne;
	WeightType G[MaxVertexNum][MaxVertexNum];
	DataType Data[MaxVertexNum]; 
};
typedef PtrToGNode MGraph;

typedef struct ENode * PtrToENode;
struct ENode{
	Vertex V1,V2;
	WeightType Weight;
};
typedef PtrToENode Edge;

//队列的数据结构 
typedef int ElementType;
typedef struct QNode * PtrToQNode;
struct QNode{
	int * Data;
	int Front,Rear;
	int MaxSize;
}; 
typedef PtrToQNode Queue;

bool Visited[]={false};

//队列的算法
//创建队列
Queue CreateQueue(int MaxSize){
	Queue Q = (Queue)malloc (sizeof(struct QNode));
	Q->Data=(ElementType *)malloc(MaxSize * sizeof(ElementType));
	Q->Front=Q->Rear=0;
	Q->MaxSize=MaxSize;
	return Q; 
} 

//入队
bool IsFull(Queue Q){
	return ((Q->Rear+1) % Q->MaxSize == Q->Front);
} 

bool AddQ(Queue Q,int X){
	if(IsFull(Q)){
		printf("队列满\n");
	}else{
		Q->Rear=(Q->Rear+1) % Q->MaxSize;
		Q->Data[Q->Rear] = X;
		return true;
	}
}

bool IsEmpty(Queue Q){
	return (Q->Front==Q->Rear);
} 

#define ERROR -1
int DeleteQ(Queue Q){
	if(IsEmpty(Q)){
		printf("队列空\n");
		return ERROR;
	}else{
		Q->Front=(Q->Front+1) % Q->MaxSize;
		return Q->Data[Q->Front];
	}
}

//图的相关算法

//1.图的初始化 
MGraph CreateGraph(int VertexNum){
	Vertex V,W;
	MGraph Graph;
	
	Graph=(MGraph)malloc(sizeof(struct GNode));
	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->Weight;
	Graph->G[E->V2][E->V1]=E->Weight;
}

//图的创建算法 
MGraph BuildGraph(){
	MGraph Graph;
	Edge E;
	Vertex V;
	int Nv,i;
	
	printf("请输入顶点个数: "); 
	scanf("%d",&Nv);
	Graph=CreateGraph(Nv);
	
	printf("请输入边的个数: "); 
	scanf("%d",&(Graph->Ne));
	if(Graph->Ne!=0){
		E=(Edge)malloc(sizeof(struct ENode));
		for(i=0;i<Graph->Ne;i++){
			//输入带权重的边 
			printf("读入边，格式为起点 终点 权重。请输入: "); 
			scanf("%d %d %d",&E->V1,&E->V2,&E->Weight);
			InsertEdge(Graph,E);
		}
	}
	//如果顶点有数据的话、插入数据 
//	for(V=0;V<Graph->Nv;V++)
//		scanf("%c",&(Graph->Data[V]));
		
	return Graph;
}


// 广度优先遍历输出结点算法 
void Visit(Vertex V){
	printf("正在访问顶点%d\n");
}

 
 
//邻接矩阵存储图的广度优先遍历
bool IsEdge(MGraph Graph,Vertex V,Vertex W){
	return Graph->G[V][W]<INFINITY ? true : false;
} 
 
void BFS(MGraph Graph,Vertex S,void(*Visit)(Vertex)){
	Queue Q;
	Vertex V,W;
	
	Q=CreateQueue(10);
	Visit(S);
	Visited[S]=true;
	AddQ(Q,S);
	
	while(!IsEmpty(Q)){
		V=DeleteQ(Q);
		for(W=0;W<Graph->Nv;W++){
			if(!Visited[W]&&IsEdge(Graph,V,W)){
				Visit(W);
				Visited[W]=true;
				AddQ(Q,W);
			}
		} 
	} 
}

int main(){
	MGraph graph= BuildGraph();
	int s =0 ;
	BFS(graph,s,Visit);
	return 0;
}

运行结果：