问题: 假设一张图中总共有n个节点,编号0 ~ n - 1, 计算K节点到所有其他节点的最短距离
初始化: vector<int> dist(n, INT_MAX)
边:vector<vector<int>> edges;
邻接表:vector<vector<int>> adj;
for (int i = 0; i < n; i++) {
for (auto edge : edges) {
dist[edge[1]] = min(dist[edge[1]], dist[edge[0]] + adj[edge[0]][edge[1]])
}
}