dijkstratest.c

来自「《数据结构-使用C语言》第三版」· C语言 代码 · 共 39 行

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

typedef char DataType;
#define MaxSize 100
#define MaxVertices 10
#define MaxWeight 10000

#include"AdjMGraph.h"

#include"Dijkstra.h"


int main()
{
	AdjMGraph g;
	char a[]={'A','B','C','D','E','F','G','H'};
	RowColWeight row[]={{0,1,10},{0,4,20},{1,3,30},{2,1,40},{3,2,50},
						{0,5,30},{1,6,35},{4,7,23},{1,0,40}};
	int n=8, e=9;
	
	int i, distance[8], path[8];
	
	CreatGraph(&g, a, n, row, e);
	
	Dijkstra(g, 0, distance, path);
	
	printf("\n从节点 %c 到其他各点的最短距离为:\n",g.Vertices.list[0]);
	for(i=0;i<n;i++)
	printf("到节点 %c 的最短距离为 %d:\n", g.Vertices.list[i], distance[i]);
	printf("\n从节点 %c 到其他各点的最短路径的前一节点为:\n", g.Vertices.list[0]);
	for(i=0;i<n;i++)
	if(path[i]!=-1)
	printf("到节点 %c 的前一节点为 %c:\n",g.Vertices.list[i], g.Vertices.list[path[i]]);
	
	getchar();
}