shek的博客

概要初始状态时候两点的距离：A[i][j]=0(如果i==j)A[i][j] = 0 (如果i == j)A[i][j]=0(如果i==j)A[i][j]=∞(如果i!=j,且无边相连)A[i][j] = ∞ (如果 i != j, 且无边相连)A[i][j]=∞(如果i!=j,且无边相连)A[i][j]=W[i][j](如果i!=j,且有边相连接)A[i][j] = W[i][j] (如果 i != j, 且有边相连接)A[i][j]=W[i][j](如果i!=j,且有边相连接)计算最短路径A

图片示意代码#include <bits/stdc++.h>using namespace std;int findFather(int v);int find(int v);void Union(int x, int y);int parent[4];int findFather(int v) { if (parent[v] != v) { parent[v] = findFather(parent[v]); } return

图解步骤具体代码#ifndef UNTITLE_MATGRAPH_H#define UNTITLE_MATGRAPH_H#endif //UNTITLE_MATGRAPH_H#define MAXV 10#define INF 32767typedef struct { int no; //顶点的编号 char info; //顶点的其他信息}VertexType; //顶

dijskra#ifndef UNTITLE_MATGRAPH_H#define UNTITLE_MATGRAPH_H#endif //UNTITLE_MATGRAPH_H#define MAXV 10#define INF 32767typedef struct { int no; //顶点的编号 char info; //顶点的其他信息}VertexType; //顶点的类型type