图论-单源最短路算法-dijkstra朴素版

时间复杂度：$O(n^2)$

模板

void dijkstra()
{
    memset(dist, 0x3f, sizeof dist);
    dist[1] = 0;
    //遍历n次，每次把一个dist最小的点放入集合中
    for (int i = 1; i <= n; i ++ )
    {
        int t = -1;
        for (int j = 1; j <= n; j ++ )
       	    //如果j点没被使用过，且j点为当前最短
            if (!st[j] && (t == -1 || dist[t] > dist[j]))    
                t = j;

        st[t] = true;
        //用t点更新最短值
        for (int j = 1; j <= n; j ++ )
            dist[j] = min(dist[j], dist[t] + g[t][j]);
    }
}