D

使用邻接矩阵实现有向图最短路径Dijkstra算法 题目编号:1136

用邻接矩阵存储有向图，实现最短路径Dijkstra算法，图中边的权值为整型，顶点个数少于10个。

部分代码提示：

#include

#include

using namespace std;

const int MaxSize = 10;

const int INF = 32767;

class MGraph

{

public:

MGraph(char a[], int n, int e);

void Dijkstra();

private:

char vertex[MaxSize];

int arc[MaxSize][MaxSize];

int vertexNum, arcNum;

};

MGraph::MGraph(char a[], int n, int e)

{

//write your code.

}

int Min(int dist[], int vertexNum)

{

//write your code.

}

void MGraph::Dijkstra()

{

//write your code.

}

int main()

{

int n = 0;

int e = 0;

cin >> n >> e;

char p[MaxSize];

int i = 0; 

for (i=0; i