c语言求有向图的最短路径代码

以下是使用C语言求有向图最短路径的代码，使用了Dijkstra算法：

#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\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, 1, 4, 0, 0, 0},
                       {0, 0, 2, 5, 10, 0},
                       {0, 0, 0, 0, 2, 0},
                       {0, 0, 0, 0, 0, 4},
                       {0, 0, 0, 0, 0, 6},
                       {0, 0, 0, 0, 0, 0}};
    dijkstra(graph, 0);
    return 0;
}