随笔 dijkstra算法

#include<iostream>
#include<vector>
using namespace std;

vector<int> dijkstra(vector<vector<int>> edge)
{
	int n = edge.size();
	vector<int> dist(n, 0);//0到每个顶点的距离
	vector<int> flag(n, 0);//状态标记:改点是否已经被探索过
	flag[0] = 1;
	for (int i = 0;i < n;++i)
		dist[i] = edge[0][i];
	//dijkstra
	int last_node = 0;
	int next_node = last_node;
	for (int i = 0; i < n - 1;++i)
	{
		//find min
		int mMin = INT_MAX;
		for (int j = 0;j < n;++j)
		{
			if (flag[j] == 0 && dist[j] < mMin)
			{
				mMin = dist[j];
				next_node = j;
			}
		}
		flag[next_node] = 1;
		if (next_node == last_node)
			continue;
		else
		{
			last_node = next_node;//探索失败
		}
		for (int e = 0;e < n;++e)
		{
			if (edge[next_node][e] < INT_MAX)
			{
				if (dist[e] > dist[next_node] + edge[next_node][e])
					dist[e] = dist[next_node] + edge[next_node][e];
			}
		}
		//不断更新dist数组
		for (int i = 0;i < n;++i)
			cout << dist[i] << " ";
		cout << endl;
	}
	cout << "****************************************************************" << endl;
	for (int i = 0;i < n;++i)
		cout << dist[i] << " ";
	cout << endl;
	return dist;
}
int main()
{
	int n;
	cin >> n;//顶点数
	vector<vector<int>> edge(n, vector<int>(n, 0));
	for (int i = 0;i < n;++i)
		for (int j = 0;j < n;++j)
			if (i == j)
				edge[i][j] = 0;
			else
				edge[i][j] = INT_MAX;
	int m, x, y, z;
	cin >> m;//边数
	for (int i = 0;i < m;++i)
	{
		cin >> x >> y >> z;
		edge[x][y] = z;
	}
	vector<int> dist = dijkstra(edge);
	system("pause");
	return 0;
}