迪杰斯特拉(Dijkstra)算法

当然，下面是一个用C++实现的Dijkstra算法的示例：

#include <iostream>
#include <limits.h>

#define V 9

int minDistance(int dist[], bool visited[]) {
    int min = INT_MAX, min_index;

    for (int v = 0; v < V; v++) {
        if (!visited[v] && dist[v] <= min) {
            min = dist[v];
            min_index = v;
        }
    }

    return min_index;
}

void printSolution(int dist[]) {
    std::cout << "Vertex \t Distance from Source\n";
    for (int i = 0; i < V; i++) {
        std::cout << i << "\t\t" << dist[i] << std::endl;
    }
}

void dijkstra(int graph[V][V], int source) {
    int dist[V];
    bool visited[V];

    for (int i = 0; i < V; i++) {
        dist[i] = INT_MAX;
        visited[i] = false;
    }

    dist[source] = 0;

    for (int count = 0; count < V - 1; count++) {
        int u = minDistance(dist, visited);

        visited[u] = true;

        for (int v = 0; v < V; v++) {
            if (!visited[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, 0, 0, 0, 0, 0, 8, 0},
                       {4, 0, 8, 0, 0, 0, 0, 11, 0},
                       {0, 8, 0, 7, 0, 4, 0, 0, 2},
                       {0, 0, 7, 0, 9, 14, 0, 0, 0},
                       {0, 0, 0, 9, 0, 10, 0, 0, 0},
                       {0, 0, 4, 14, 10, 0, 2, 0, 0},
                       {0, 0, 0, 0, 0, 2, 0, 1, 6},
                       {8, 11, 0, 0, 0, 0, 1, 0, 7},
                       {0, 0, 2, 0, 0, 0, 6, 7 ,0}};

    dijkstra(graph, 0);

    return 0;
}

这个实现使用Dijkstra算法来计算从指定源点到图中所有其他顶点的最短路径。图以邻接矩阵的形式表示，其中权重用于表示顶点之间的距离。`printSolution`函数用于显示最短路径结果。