for (int i = 1; i <= n; i++) {distance[i] = edge[1][i];     //edge[1][I]为邻接矩阵存储方式 flag[i] = false;            //表示i号结点是否已经被标记为最短路，防止重复遍历
}
flag[1] = true; 

for (int i = 1, min, u; i <= n - 1; i++) {min = 0x7fffffff;for (int j = 1; j <= n; j++) {if (!flag[[j] && distance[j] < min) {min = distance[j];    //选取最小的distance u = j;}}flag[u] = true;for (int k = 1; k <= n; k++) {//如果有边 if (edge[u][v] < 0x7fffffff) {if (distance[v] > distance[u] + edge[u][v]) {distance[v] = distance[u] + edge[u][v]}}}
}for (int i = 1; i <= n; i++) {printf ("%d ", distance[i]);
}

#include <cstdio>
#include <queue>
#include <limits.h>
#define maxn 1005struct Node {int diktc; bool visited;struct Edge* edges;bool operator () (const Node *a, const Node *b) {return a->diktc > b->diktc;}Node () : diktc (INT_MAX) , visited (false) {}
} nodes[maxn];struct Edge {int weight;Node* to;Edge* next;Edge () {}Edge (int w, Node* t) : weight (w), to(t) {}
};inline void EdgeMaker (const int &u, const int &v, const int &w) {Edge* curEdge = new Edge(w, nodes + v);curEdge->next = nodes[u].edges;nodes[u].edges = curEdge;
}inline void EdgeDestory (const int& n) {for (int i = 0; i < n; i++) {Edge* curEdge = nodes[i].edges;while (curEdge != NULL) {Edge* tmp = curEdge;curEdge = curEdge->next;delete[] tmp;}}
}int n, m;inline void Dijkstra (const int &start) {std::priority_queue<Node*, std::vector<Node*>, Node > pq;Edge *curEdge = nodes[start].edges;while (curEdge != NULL) {curEdge->to->diktc = curEdge->weight;pq.push (curEdge->to);curEdge = curEdge->next;}nodes[start].diktc = 0;nodes[start].visited = true;for (int i = 0; i < n; i++) {pq.push (nodes + i);}for (int i = 0, u; i < n - 1; i++) {while (pq.top()->visited) {pq.pop();}u = pq.top() - nodes;pq.pop();nodes[u].visited = true;curEdge = nodes[u].edges;while (curEdge != NULL) {if (curEdge->to->diktc > nodes[u].diktc + curEdge->weight) {curEdge->to->diktc = nodes[u].diktc + curEdge->weight;pq.push (curEdge->to);}curEdge = curEdge->next;}}for (int i = 1; i <= n; i++) {printf ("%d ", nodes[i].diktc);}printf ("\n");
}int main () {scanf("%d %d", &n, &m);for (int i = 0, u, v, w; i < m; i++) {scanf ("%d %d %d", &u, &v, &w);EdgeMaker (u, v, w);//    EdgeMaker (v, u, w);
    }Dijkstra (1);EdgeDestory (n);return 0;}