Dijstra算法实现——C++（邻接矩阵）

#include<iostream>
#include<iomanip>
#include<cstring>
#include<stack>
#define MAX 100
#define INF 0x3f3f3f3f
using namespace std;
int dist[MAX],path[MAX];
struct MGraph
{
    int edges[MAX][MAX];//邻接矩阵
    int n,e;//顶点数和边数
}G;
void init() {
    memset(G.edges,INF,sizeof(G.edges));//初始化每条边权值为无穷大
}
void insert(int u,int v,int w){
     G.edges[u][v]=w;
}
void printfPath(int path[],int a)
{
    stack <int> stk;
    while(path[a]!=-1)
    {
        stk.push(a);
        a=path[a];
    }
    stk.push(a);
    cout<<"最短路径："<<endl;
    while(!stk.empty())
    {
        cout<<stk.top()<<" ";
        stk.pop();
    }
    cout<<endl;
}
using namespace std;
void Dijstra(MGraph g,int v,int dist[],int path[])
{
    int set[MAX],min,i,j,u;
    for(i=0;i<g.n;i++)
    {
        dist[i]=g.edges[v][i];
        set[i]=0;
        if(g.edges[v][i]<INF)
        {