C++Dijkstra算法求最短路径

#pragma once
#include"MGraph.h"
#include<iostream>
#include<vector>
using namespace std;

class Dijkstra {
public:
	Dijkstra() = default;
	~Dijkstra() = default;
	void DijkstraAlgorithm(const MGraph&M) {
		//init data
		for (int i = 0;i < M.NumVertexes - 1;++i) shortest.push_back(Infinity);
		for (int i = 0;i < M.NumVertexes;++i) visited.push_back(false);
		//main body
		cout << "Please input the beginning:";
		int begin;
		cin >> begin;
		visited[begin] = true;
		aim.push_back(begin);
		cout << "Please input the end:";
		int end;
		cin >> end;
		int count = 0;
		while (begin!=end) {
			int flag = 0;
			for (int i = 0;i < M.NumVertexes;++i) {
				if (i != begin && M.arc[begin][i] < shortest[count] && !visited[i]) {
					shortest[count] = M.arc[begin][i];
					flag = i;
				}
			}
			visited[flag] = true;
			aim.push_back(flag);
			begin = flag;
			count++;
		}
		int index = 0;
		while (shortest[index] != Infinity) index++;
		shortest.resize(--index);
	}
	void Show() {
		cout << "Shortest road:";
		for (auto &x : aim) {
			cout << x << " ";
		}
		cout << endl;
		cout << "Shortest weight:";
		int sum = 0;
		for (auto& x : shortest) {
			cout << x << " ";
			sum += x;
		}
		cout << "sum:" << sum << endl;
	}
private:
	vector<int>aim;
	vector<int>shortest;
	vector<bool>visited;
};

MGraph.h是无向图的邻接矩阵。整体思路与Prim算法相似，不同之处主要有两点：
1.将顶点纳入最短路径后需从此点继续寻找。
2.有终点且最终被纳入的顶点数不确定。