最短路径 Dijkstra

#include <iostream>
#include <stdlib.h>
using namespace std;

const int N = 20;
const int MAX_DIS = 10000;
int dis[N];  //v0到i的最短路径长度
int pre[N];  //节点i的前驱
int dd[N][N]; //节点之间距离
int sort_id[N]; //记录dis[n]排序后的下标，关键
int n;

void init()
{
    int e;
    cout<<"number of node(less than "<<N<<"): ";
    cin>>n;
    cout<<"number of edge: ";
    cin>>e;
    int v1, v2, d, i, j;
    //初始化
    for(i=0; i<n; i++)
    {
        for(j=0; j<n; j++)
            dd[i][j] = MAX_DIS;
        sort_id[i] = i;
        pre[i] = -1;
        dis[i] = MAX_DIS;
    }
    //赋值
    for(i=0; i<e; i++)
    {
        cin>>v1;
        cin>>v2;
        cin>>d;
        dd[v1][v2] = d;
        pre[v2] = v1;
        if(v1 == 0)
            dis[v2] = d;
    }
}

void print_path(int i)
{
    if(pre[i] == -1)
    {
        cout<<i<<" ";
        return ;
    }
    print_path(pre[i]);
    cout<<i<<" ";
        
}

void solu()
{
    int i,j;
    int min_id;
    for(i=1; i<n-1; i++)
    {
        //找到从i开始的最短路径
        min_id = sort_id[i];
        for(j=i+1; j<n; j++)
        {
            if(dis[sort_id[j]]<dis[min_id])
                min_id = j;
        }
        swap(sort_id[min_id], sort_id[i]);
        //根据i，重新调整i+1到n-1.
        for(j=i+1; j<n; j++)
        {
            int temp = dis[sort_id[i]] + dd[sort_id[i]][sort_id[j]];
            if(dis[sort_id[j]]>temp)
            {
                dis[sort_id[j]] = temp;
                pre[sort_id[j]] = sort_id[i];
            }
        }
    }
    //输出源点到所有其他点的最短路径
    cout<<endl<<"The shortest path: "<<endl;
    for(i=1; i<n; i++)
    {
        j = i;
        if(pre[j] == -1)
        {
            cout<<"can't get to: "<<j<<endl;
            continue;
        }
        print_path(i);
        cout<<"\t,distance: "<<dis[i]<<endl;
    }
}

int main()
{
    init();
    solu();
}