【学习笔记】数据结构--最短路径问题（弗洛伊德和迪迦特斯拉）

前向星

void add_edge(int u, int v, int w) {
    //加边，u起点，v终点，w边权
	edge[cnt].to = v; //终点
	edge[cnt].w = w; //权值
	edge[cnt].next = head[u];//以u为起点上一条边的编号，也就是与这个边起点相同的上一条边的编号
	head[u] = cnt++;//更新以u为起点上一条边的编号
}

弗洛伊德（floyd）

void Floyd(MGraph *mGraph, int **iArrPath) {
   
	for (int i = 1; i <= mGraph->iVertexCount; i++) {
   
		for (int j = 1; j <= mGraph->iVertexCount; j++) {
   
			iArrPath[i][j] = i;
		}
	}//初始化路径表
	for (int k = 1; k <= mGraph->iVertexCount; k++) {
   
		for (int i = 1; i <= mGraph->iVertexCount; i++) {
   
			for (int j = 1; j <= mGraph->iVertexCount; j++) {
   
				if (mGraph->edges[i][k] + mGraph->edges[k][j] < mGraph->edges[i][j]) {
   
					mGraph->edges[i][j] = mGraph->edges[i][k] + mGraph->edges[k][j