WhyCan Forum(哇酷开发者社区)

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

#define V                   10 // 给定点的数量
#define AMI_INT_MAX         AMI_INT

int graph[V][V] = { // 给定的邻接矩阵
    { 0, 4, 3, 0, 0, 0, 0, 8, 0, 0 },
    { 4, 0, 0, 0, 0, 0, 0, 11, 0, 0 },
    { 3, 0, 0, 7, 0, 0, 0, 0, 0, 0 },
    { 0, 0, 7, 0, 9, 14, 0, 0, 0, 0 },
    { 0, 0, 0, 9, 0, 10, 0, 0, 0, 0 },
    { 0, 0, 0, 14, 10, 0, 2, 0, 0, 0 },
    { 0, 0, 0, 0, 0, 2, 0, 1, 6, 0 },
    { 8, 11, 0, 0, 0, 0, 1, 0, 7, 0 },
    { 0, 0, 0, 0, 0, 0, 6, 7, 0, 5 },
    { 0, 0, 0, 0, 0, 0, 0, 0, 5, 0 },
};

int minDistance(int dist[], int visited[]) {
    int minDist = AMI_INT_MAX, minDistIndex;
    for (int i = 0; i < V; i++) {
        if (!visited[i] && dist[i] <= minDist) {
            minDist = dist[i];
            minDistIndex = i;
        }
    }
    return minDistIndex;
}

void dijkstra(int src) {
    int dist[V], visited[V];
    for (int i = 0; i < V; i++) {
        dist[i] = AMI_INT_MAX;
        visited[i] = 0;
    }
    dist[src] = 0;
    for (int i = 0; i < V - 1; i++) {
        int u = minDistance(dist, visited);
        visited[u] = 1;
        for (int v = 0; v < V; v++) {
            if (!visited[v] && graph[u][v] && dist[u] != AMI_INT_MAX
                && dist[u] + graph[u][v] < dist[v]) {
                dist[v] = dist[u] + graph[u][v];
            }
        }
    }
    printf("顶点\t距离\n");
    for (int i = 0; i < V; i++) {
        printf("%d\t%d\n", i, dist[i]);
    }
}

int main() {
    dijkstra(0);
    return 0;
}