迪杰斯特拉算法c++邻接矩阵
时间: 2023-08-03 21:50:43 浏览: 61
下面是C++实现的Dijkstra算法的邻接矩阵版本:
```c++
#include <iostream>
#include <limits.h>
using namespace std;
#define V 5 // 图中的顶点数
int minDistance(int dist[], bool sptSet[]) {
int min = INT_MAX, min_index;
for (int v = 0; v < V; v++)
if (sptSet[v] == false && dist[v] <= min)
min = dist[v], min_index = v;
return min_index;
}
void printSolution(int dist[]) {
cout << "顶点 距离源点的最短距离" << endl;
for (int i = 0; i < V; i++)
cout << i << " " << dist[i] << endl;
}
void dijkstra(int graph[V][V], int src) {
int dist[V];
bool sptSet[V];
for (int i = 0; i < V; i++)
dist[i] = INT_MAX, sptSet[i] = false;
dist[src] = 0;
for (int count = 0; count < V - 1; count++) {
int u = minDistance(dist, sptSet);
sptSet[u] = true;
for (int v = 0; v < V; v++)
if (!sptSet[v] && graph[u][v] && dist[u] != INT_MAX && dist[u] + graph[u][v] < dist[v])
dist[v] = dist[u] + graph[u][v];
}
printSolution(dist);
}
int main() {
int graph[V][V] = { { 0, 4, 0, 0, 8 },
{ 4, 0, 8, 0, 2 },
{ 0, 8, 0, 7, 0 },
{ 0, 0, 7, 0, 9 },
{ 8, 2, 0, 9, 0 } };
dijkstra(graph, 0);
return 0;
}
```
这里的图为一个5个顶点的图,可以根据需要修改V的值。同时也可以根据需要修改图的邻接矩阵。