算法15讲——Path in Graph

最新推荐文章于 2024-09-25 08:05:38 发布

蓝鲸瓜皮小正义

最新推荐文章于 2024-09-25 08:05:38 发布

阅读量420

点赞数

分类专栏：算法导论文章标签：算法 dijkstra

本文链接：https://blog.csdn.net/justice0/article/details/73742212

版权

算法导论专栏收录该内容

5 篇文章 0 订阅

订阅专栏

一、Single Source Shortest Paths（单源最短路径）

Dijkstra’s algorithm

对于一个uniformly weighted graph（权值均相同的图），只需要BFS就可以得到。
Dijkstra’s algorithm

Void shortestPaths(EdgeList[] adjInfo, int n, int s, int[] parent, float[]fringeWgt)
    int[] status = new int[n+1];
    MinPQ pq = create(n, status, parent, fringeWgt);
    insert(pq, s, ‐1, 0);
    while(isEmpty(pq)==false)
        int v = getMin(pq);
        deleteMin(pq);
        updateFringe(pq, adjInfo[v], v);

void updateFringe(MinPQ pq, EdgeList adjInfoOfV, int v)
    float myDist = pq.fringeWgt[v];
    EdgeList remAdj;
    remAdj = adjInfoOfV;
    while{remAdj != nil}
        EdgeInfo wInfo = first(remAdj);
        int w = wInfo.to;
        float newDist = myDist + wInfo.weight;
        if(pq.status[w]==unseen)
            insert(pq,w,v,newDist);
        else if(pq.status[w] = fringe)
            if(newDist < getPriority(pq,w))
                decreaseKey(pq,w,v,newDist);
        remAdj = rest(remAdj);
    return;

正确性证明

略

二、All‐pairs Shortest Path（多源最短路径）

Dijkstra’s 框架延伸

Single‐source shortest path (SSSP)单源最短路径
SSSP + node weight constraint
SSSP + capacity constraint

Warshall’s algorithm

void simpleTransitiveClosure(boolean[][] A, int n, boolean[][] R)
    int i,j,k;
    Copy A to R;
    Set all main diagonal entries, rii, to true;
    while (any entry of R changed during one complete pass)
    for (k=1; k<=n; k++)
        for (i=1; i<=n; i++)
            for (j=1; j<=n; j++)
                rij=rij | (rik & rkj)

Floyd’s algorithm

Void allPairsShortestPaths(float [][] W, int n, float [][] D)
    int i, j, k;
    Copy W into D;
    for (k=1; kn; k++)
        for (i=1; in; i++)
            for (j=1; jn; j++)
                D[i][j] = min (D[i][j], D[i][k]+D[k][j]);