标签：distance int graph 路径 finished 最短 ++ 算法 &&

最短路径算法

Dijkstra

algorithm description

1. Select a source, and initialize the distance of other nodes to the source and finished as false
2. Find the minimum distance from dis[] and the node must be not finished
3. Update all the dis[] based on the current selected node
4. Repeat until all the nodes are finished.

time complexity: O(|V|²)

void dijkstra(int[][] graph, int source)
    {
        int[] distance = new int[V];
        Boolean[] finished = new Boolean[V];
        for (int i = 0; i < V; i++)
        {
            distance[i] = Integer.MAX_VALUE;
            finished[i] = false;
        }
        distance[source] = 0;
        //v-1个node
        for (int count = 0; count < V-1; count++)
        {
            int u = minDistance(distance, finished);
            finished[u] = true;
            for (int v = 0; v < V; v++)
                if (!finished[v] && graph[u][v]!=0 &&
                        distance[u] != Integer.MAX_VALUE &&
                        distance[u]+graph[u][v] < distance[v])
                    distance[v] = distance[u] + graph[u][v];
        }
    }
    int minDistance(int[] distance, Boolean[] finished)
    {
        int min = Integer.MAX_VALUE, min_index=-1;
        for (int v = 0; v < V; v++) {
            if (!finished[v] && distance[v] <= min) {
                min = distance[v];
                min_index = v;
            }
        }
        return min_index;
    }

Flyod

 Floyd–Warshall algorithm is an algorithm based on Dynamic Programming for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).

The Floyd–Warshall algorithm compares all possible paths through the graph between each pair of vertices.

Find shortest possible path from i to j using vertices only from the set {1, 2, ..., k} as intermediate points along the way.

time complexity: O(|V|³)

core code is pretty simple

for (int k = 0; k < n; ++k)
            for (int i = 0; i < n; ++i)
                for (int j = 0; j < n; ++j) {
                    if(A[i][j]>A[i][k]+A[j][k]){
                        A[i][j]=A[i][k]+A[j][k];
                        path[i][j]=k;
                    }
                }

标签：distance,int,graph,路径,finished,最短,++,算法,&&
来源： https://www.cnblogs.com/xiaoqian-shen/p/15429033.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。