c语言-最短路径算法

#pragma once
#include <stdio.h>
#define n 7

void path_main() {
	int max = 99999;
	int graph[n][n] = {
		0  ,4  ,6  ,6  ,max,max,max,
		max,0  ,1  ,max,7  ,max,max,
		max,max,0  ,max,6  ,4  ,max,
		max,max,2  ,0  ,max,5  ,max,
		max,max,max,max,0  ,max,6  ,
		max,max,max,max,1  ,0  ,8  ,
		max,max,max,max,max,max,0  ,
	};

	int dist[n] = { 0,max,max,max,max,max,max };
	for (int i = 1; i < n; i++) {
		for (int j = 0; j <i; j++) {
			if(dist[j]+graph[j][i]< dist[i])
				dist[i] = dist[j] + graph[j][i];
		}
		for (int j = 0; j < i; j++) {
			if (dist[i] + graph[i][j] < dist[j])
				dist[j] = dist[i] + graph[i][j];
		}
	}
	for (int i = 0; i < n; i++) {
		printf("%d ", dist[i]);
	}
}