c语言迪杰斯特拉求最短路径
作者:野牛程序员:2023-12-21 12:57:03C语言阅读 2148
迪杰斯特拉算法是一种用于求解图中单源最短路径的算法。以下是一个简单的C语言实现示例:
#include <stdio.h> #include <limits.h> #define V 6 // 图中顶点的数量 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 printSolution(int dist[]) { printf("顶点\\t最短路径\\n"); for (int i = 0; i < V; i++) { printf("%d\\t%d\\n", i, dist[i]); } } void dijkstra(int graph[V][V], int src) { int dist[V]; int sptSet[V]; for (int i = 0; i < V; i++) { dist[i] = INT_MAX; sptSet[i] = 0; } 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]) { dist[v] = dist[u] + graph[u][v]; } } } printSolution(dist); } int main() { int graph[V][V] = {{0, 10, 0, 5, 0, 0}, {0, 0, 1, 2, 0, 0}, {0, 0, 0, 0, 4, 0}, {0, 3, 9, 0, 2, 0}, {7, 0, 6, 0, 0, 0}, {0, 0, 0, 0, 0, 0}}; dijkstra(graph, 0); return 0; }
野牛程序员教少儿编程与信息学奥赛-微信|电话:15892516892
- 上一篇:Arduino开发GSM火焰警报系统
- 下一篇:迪杰斯特拉算法原理