Dijkstra算法

#include <iostream>

using namespace std;
#include<cstring>

int graph[10][10];
int dist[10];
int s[10];
int path[10][10];

void createGraph(int n) {
    int gLeft, gRight, weight;
    for (int i = 0; i < n; i++) {
        cin >> gLeft >> gRight >> weight;
        graph[gLeft][gRight] = weight;
        graph[gRight][gLeft] = weight;
    }
}

int minDist(int n) {
    int min = 10000, minIndex;
    for (int i = 0; i < n; ++i) {
        if (s[i] == 0 && dist[i] <= min) {
            min = dist[i];
            minIndex = i;
        }
    }
    return minIndex;
}

void dijkstra(int n,int startV) {
    for(int i=0;i<n;i++){
        dist[i]=1000000;
        s[i]=0;
    }
    dist[startV]=0;
    for(int i=0;i<n-1;i++){
        int m= minDist(n);
        s[m]=1;
        for(int j=0;j<n;j++){
            if(!s[j]&&graph[i][j]&&dist[m]!=1000000&&dist[m]+graph[i][j]<dist[j]){
                dist[j]=dist[m]+graph[i][j];
            }
        }
    }
}

int main() {
    int n;
    cin>>n;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            graph[i][j]=0;
        }
    }
    int m;
    cin>>m;
    createGraph(m);
    dijkstra(n,0);
    for (int i = 0; i < n; ++i) {
        cout<<i<<" "<<dist[i]<<endl;
    }
}