校园地图有15个建筑23条路经,用迪杰斯特拉算法,输入1个建筑,输出这个建筑到另外14个建筑的最短路径,用C语言写代码
时间: 2024-04-03 16:31:40 浏览: 9
好的,我可以为您提供一个基于迪杰斯特拉算法的C语言代码,用于输出一个建筑到其他14个建筑的最短路径。以下是代码:
```c
#include <stdio.h>
#include <limits.h>
#define V 15
int minDistance(int dist[], int sptSet[]) {
int min = INT_MAX, min_index;
for (int v = 0; v < V; v++)
if (sptSet[v] == 0 && dist[v] <= min)
min = dist[v], min_index = v;
return min_index;
}
void printPath(int parent[], int j) {
if (parent[j] == -1)
return;
printPath(parent, parent[j]);
printf("%d ", j);
}
int printSolution(int dist[], int n, int parent[]) {
int src = 0;
printf("Vertex\t Distance\tPath");
for (int i = 1; i < V; i++) {
printf("\n%d -> %d \t\t %d\t\t%d ", src, i, dist[i], src);
printPath(parent, i);
}
}
void dijkstra(int graph[V][V], int src) {
int dist[V], sptSet[V], parent[V];
for (int i = 0; i < V; i++)
dist[i] = INT_MAX, sptSet[i] = 0, parent[0] = -1;
dist[src] = 0;
for (int count = 0; count < V - 1; count++) {
int u = minDistance(dist, sptSet);
sptSet[u] = 1;
for (int v = 0; v < V; v++) {
if (!sptSet[v] && graph[u][v] && dist[u] != INT_MAX
&& dist[u] + graph[u][v] < dist[v]) {
parent[v] = u;
dist[v] = dist[u] + graph[u][v];
}
}
}
printSolution(dist, V, parent);
}
int main() {
int graph[V][V] = { { 0, 2, 4, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 2, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 4, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 3, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 3, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 5, 1, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 6, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 4, 0, 0, 0, 3, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 3, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 2, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 4, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 5, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 6 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 6, 0 } };
dijkstra(graph, 0);
return 0;
}
```
这是一个简单的例子,其中包含了15个建筑和23条路径。您可以更改数组`graph`的值以适应您的实际情况。在此代码中,路径的权重是手动输入的,您可以根据需要更改这些权重。