最短路径dijkstra算法代码c语言

Dijkstra算法是一种贪心算法，用于求解带权重的图中从一个点到其他所有点的最短路径。以下是Dijkstra算法的C语言代码实现：

#include <stdio.h>
#include <limits.h>

#define V 6

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[]) {
    printf("Vertex \t Distance from Source\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];
  
    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, 2, 0, 0, 0 },
                        { 4, 0, 1, 5, 0, 0 },
                        { 2, 1, 0, 8, 10, 0 },
                        { 0, 5, 8, 0, 2, 6 },
                        { 0, 0, 10, 2, 0, 3 },
                        { 0, 0, 0, 6, 3, 0 } };
  
    dijkstra(graph, 0);
  
    return 0;
}