多源最小路径长度Floyd算法代码实现

main.cpp

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

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

Floyd.h

#ifndef Dijkstra

#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;


void InsertEdge(MGraph Graph, Edge E);
MGraph BuildGraph();
void Floyd(MGraph Graph, Vertex S);


#endif // !BFS
#pragma once

Floyd.cpp

#include"Floyd.h"
#include"stdlib.h"
#include"stdio.h"


int dist[MaxVertexNum][MaxVertexNum];
int path[MaxVertexNum][MaxVertexNum];



//创建一个没有边的图
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;
}

//构建一个图
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 Visit(Vertex V)
{
	printf("正在访问顶点%d\n", V);
}

bool IsEdge(MGraph Graph, Vertex V, Vertex W)
{
	return Graph->G[V][W] < INFINITY ? true : false;
}





void Floyd(MGraph Graph, Vertex S)
{   
	Vertex i,j,k;
	//初始化path和dist

	for (i = 0;i < Graph->Nv;i++)
	{
		for ( j = 0; j < Graph->Nv; j++)
		{
			dist[i][j] = Graph->G[i][j];
			path[i][j] = -1;
		}
	}

	for ( k = 0; k < Graph->Nv; k++)
	{
		for (i = 0; i < Graph->Nv; i++)
		{
			for (j = 0; j < Graph->Nv; j++)
			{
				if (i == j)
				{
					continue;
				}
				if (dist[i][k] + dist[k][j] < dist[i][j])
				{
					dist[i][j] = dist[i][k] + dist[k][j];
					
					if (dist[i][j] < 0)
					{
						exit(-1);//排除负值
					}

					path[i][j] = k;
				}
			}
		}
	}

	for (i = 0; i < Graph->Nv; i++)
	{
		for (j = 0; j < Graph->Nv; j++)
		{
			printf("%d 到%d最小距离是 : %d\n", i, j,dist[i][j]);
		}
	}

	printf("路径数组 :\n");

	for (i = 0; i < Graph->Nv; i++)
	{
		for (j = 0; j < Graph->Nv; j++)
		{
			printf("%d\t", path[i][j]);
		}
		printf("\n");
	}

	
}



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