Scribd Logo
Upload

Welcome to Scribd!

  • 32 views

    Shortest Paths III: All-Pairs Shortest Paths, Dynamic Programming, Matrix Multiplication, Floyd-Warshall, Johnson

    Uploaded by

    Yashashavi Ladha
    This document discusses algorithms for finding shortest paths in graphs, including all-pairs shortest paths. It presents three algorithms for solving the all-pairs shortest paths problem: 1) Running the Bellman-Ford algorithm from each vertex, taking O(V^2E) time 2) Using dynamic programming and matrix multiplication, taking O(n^4) time 3) Floyd-Warshall algorithm, which uses dynamic programming to find shortest paths between all pairs of vertices in O(n^3) time.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Shortest Paths III: All-Pairs Shortest Paths, Dynamic Programming, Matrix Multiplication, Floyd-Warshall, Johnson

    Uploaded by

    Yashashavi Ladha
    32 views14 pages
    This document discusses algorithms for finding shortest paths in graphs, including all-pairs shortest paths. It presents three algorithms for solving the all-pairs shortest paths problem: 1) Running the Bellman-Ford algorithm from each vertex, taking O(V^2E) time 2) Using dynamic programming and matrix multiplication, taking O(n^4) time 3) Floyd-Warshall algorithm, which uses dynamic programming to find shortest paths between all pairs of vertices in O(n^3) time.

    Original Description:

    41

    Original Title

    Lecture 16

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses algorithms for finding shortest paths in graphs, including all-pairs shortest paths. It presents three algorithms for solving the all-pairs shortest paths problem: 1) Running the Bellman-Ford algorithm from each vertex, taking O(V^2E) time 2) Using dynamic programming and matrix multiplication, taking O(n^4) time 3) Floyd-Warshall algorithm, which uses dynamic programming to find shortest paths between all pairs of vertices in O(n^3) time.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    32 views14 pages

    Shortest Paths III: All-Pairs Shortest Paths, Dynamic Programming, Matrix Multiplication, Floyd-Warshall, Johnson

    Uploaded by

    Yashashavi Ladha
    This document discusses algorithms for finding shortest paths in graphs, including all-pairs shortest paths. It presents three algorithms for solving the all-pairs shortest paths problem: 1) Running the Bellman-Ford algorithm from each vertex, taking O(V^2E) time 2) Using dynamic programming and matrix multiplication, taking O(n^4) time 3) Floyd-Warshall algorithm, which uses dynamic programming to find shortest paths between all pairs of vertices in O(n^3) time.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 14

    Shortest Paths III: All-pairs

    Shortest Paths, Dynamic


    Programming, Matrix
    Multiplication, FloydWarshall, Johnson
    Lecture 16

    Shortest paths
    Single-source shortest paths
    Nonnegative edge weights

    Dijkstras algorithm O(E + V lg V)

    General

    Bellman-Ford O(VE)

    DAG

    One pass of Bellman-Ford O(V + E)

    All-pairs shortest paths


    Nonnegative edge weights

    Dijkstras algorithm |V| times O(VE + V 2 lg V)

    General

    Three algorithms today.


    L16.2

    All-pairs shortest paths


    Input: Digraph G = (V, E), where |V | = n, with
    edge-weight function w : V R.
    Output: n n matrix of shortest-path lengths
    d(i, j) for all i, j V.
    IDEA #1:
    Run Bellman-Ford once from each vertex.
    Time = O(V 2E).
    Dense graph O(V 4) time.
    Good first try!
    L16.3

    Dynamic programming
    Consider the n n adjacency matrix A = (aij)
    of the digraph, and define
    dij(m) = weight of a shortest path from
    i to j that uses at most m edges.
    Claim: We have
    0 if i = j,
    (0)
    dij =
    if i j;
    and for m = 1, 2, , n 1,
    dij(m) = mink{dik(m1) + akj }.
    L16.4

    Proof of claim

    ks

    dij(m) = mink{dik(m1) + akj }


    i

    j
    M

    Relaxation!

    for k 1 to n
    do if dij > dik + akj
    then dij dik + akj

    m 1 edges

    Note: No negative-weight cycles implies


    d(i, j) = dij (n1) = dij (n) = dij (n+1) = L
    L16.5

    Matrix multiplication
    Compute C = A B, where C, A, and B are n n
    matrices:
    n
    cij aik bkj .
    k 1

    Time = Q(n3) using the standard algorithm.


    What if we map + min and +?
    cij = mink {aik + bkj}.
    Thus, D(m) = D(m1) A.
    Identity matrix = I =

    0
    0
    0
    0

    = D0 = (dij(0)).
    L16.6

    Matrix multiplication
    (continued)
    The (min, +) multiplication is associative, and
    with the real numbers, it forms an algebraic
    structure called a closed semiring.
    Consequently, we can compute
    D(1) = D(0) A = A1
    D(2) = D(1) A = A2
    M
    M
    D(n1) = D(n2) A = An1 ,
    yielding D(n1) = (d(i, j)).
    Time = Q(nn3) = Q(n4). No better than n B-F.
    L16.7

    Improved matrix
    multiplication algorithm
    Repeated squaring: A2k = Ak Ak.
    lg(n1)
    2
    4
    2
    Compute A , A , , A
    .
    O(lg n) squarings
    Note: An1 = An = An+1 = L.
    Time = Q(n3 lg n).

    To detect negative-weight cycles, check the


    diagonal for negative values in O(n) additional
    time.
    L16.8

    Floyd-Warshall algorithm
    Also dynamic programming, but faster!
    Define cij(k) = weight of a shortest path from i
    to j with intermediate vertices
    belonging to the set {1, 2, , k}.
    i

    Thus, d(i, j) = cij(n). Also, cij(0) = aij .


    L16.9

    Floyd-Warshall recurrence
    cij(k) = mink {cij(k1), cik(k1) + ckj(k1)}
    cik

    (k1)

    ckj(k1)
    j

    cij(k1)
    intermediate vertices in {1, 2, , k}

    L16.10

    Pseudocode for FloydWarshall


    for k 1 to n
    do for i 1 to n
    do for j 1 to n
    do if cij > cik + ckj
    then cij cik + ckj

    relaxation

    Notes:
    Okay to omit superscripts, since extra relaxations
    cant hurt.
    Runs in Q(n3) time.
    Simple to code.
    Efficient in practice.
    L16.11

    Transitive closure of a
    directed graph
    Compute tij =

    1 if there exists a path from i to j,


    0 otherwise.

    IDEA: Use Floyd-Warshall, but with (, ) instead


    of (min, +):
    tij(k) = tij(k1) (tik(k1) tkj(k1)).
    Time = Q(n3).

    L16.12

    Graph reweighting
    Theorem. Given a label h(v) for each v V, reweight
    each edge (u, v) E by
    (u, v) = w(u, v) + h(u) h(v).
    Then, all paths between the same two vertices are
    reweighted by the same amount.
    Proof. Let p = v1 v2 L vk be a path in the graph.
    k 1

    Then, we have w ( p ) w ( vi ,vi +1 )

    i 1
    k 1

    w(vi ,vi +1 )+ h (vi )h (vi +1 )

    i 1
    k 1

    w(vi ,vi +1 ) + h (vk ) h (v1 )

    i 1

    w( p ) + h ( v k ) h ( v1 ) .
    L16.13

    Johnsons algorithm
    1. Find a vertex labeling h such that (u, v) 0 for all
    (u, v) E by using Bellman-Ford to solve the
    difference constraints
    h(v) h(u) w(u, v),
    or determine that a negative-weight cycle exists.
    Time = O(V E).
    2. Run Dijkstras algorithm from each vertex using .
    Time = O(V E + V 2 lg V).
    3. Reweight each shortest-path length (p) to produce
    the shortest-path lengths w(p) of the original graph.
    Time = O(V 2).

    Total time = O(V E + V 2 lg V).


    L16.14

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy