Scribd Logo
Upload

Welcome to Scribd!

  • Floyd

    Uploaded by

    make1995
    8 views6 pages
    1. The document presents the results of calculating shortest paths between 6 nodes over 6 iterations using the Dijkstra algorithm. 2. Matrices are displayed showing the distance between nodes (D) and the order of nodes visited (Q) at each iteration. 3. The distances update at each iteration as shorter paths are discovered until the optimal shortest paths are found after 6 iterations.

    Original Description:

    Original Title

    Floyd.xlsx

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. The document presents the results of calculating shortest paths between 6 nodes over 6 iterations using the Dijkstra algorithm. 2. Matrices are displayed showing the distance between nodes (D) and the order of nodes visited (Q) at each iteration. 3. The distances update at each iteration as shorter paths are discovered until the optimal shortest paths are found after 6 iterations.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views6 pages

    Floyd

    Uploaded by

    make1995
    1. The document presents the results of calculating shortest paths between 6 nodes over 6 iterations using the Dijkstra algorithm. 2. Matrices are displayed showing the distance between nodes (D) and the order of nodes visited (Q) at each iteration. 3. The distances update at each iteration as shorter paths are discovered until the optimal shortest paths are found after 6 iterations.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 6

    1 2 3 4 5 6

    1 0 5 10000 6 10000 10000


    2 4 0 8 3 10000 10000 dijk=min(dij(k-1);dik(k-1)+
    TO =
    3 10000 6 0 4 8 7
    4 5 7 5 0 4 2
    5 10000 10000 5 3 0 7
    6 10000 10000 8 3 6 0

    k= 0 1 2 3 4 5 6
    1 0 5 10000 6 10000 10000 1
    2 4 0 8 3 10000 10000 2
    D0 = Q0 =
    3 10000 6 0 4 8 7 3
    4 5 7 5 0 4 2 4
    5 10000 10000 5 3 0 7 5
    6 10000 10000 8 3 6 0 6

    k= 1 1 2 3 4 5 6
    1 0 5 10000 6 10000 10000 1
    2 4 0 8 3 10000 10000 2
    D1 = Q1 =
    3 10000 6 0 4 8 7 3
    4 5 7 5 0 4 2 4
    5 10000 10000 5 3 0 7 5
    6 10000 10000 8 3 6 0 6

    k= 2 1 2 3 4 5 6
    1 0 5 13 6 10000 10000 1
    2 4 0 8 3 10000 10000 2
    D2 = Q2 =
    3 10 6 0 4 8 7 3
    4 5 7 5 0 4 2 4
    5 10000 10000 5 3 0 7 5
    6 10000 10000 8 3 6 0 6

    k= 3 1 2 3 4 5 6
    1 0 5 13 6 21 20 1
    2 4 0 8 3 16 15 2
    D3 = Q3 =
    3 10 6 0 4 8 7 3
    D3 = Q3 =

    4 5 7 5 0 4 2 4
    5 15 11 5 3 0 7 5
    6 18 14 8 3 6 0 6

    k= 4 1 2 3 4 5 6
    1 0 5 11 6 10 8 1
    2 4 0 8 3 7 5 2
    D4 = Q4 =
    3 9 6 0 4 8 6 3
    4 5 7 5 0 4 2 4
    5 8 10 5 3 0 5 5
    6 8 10 8 3 6 0 6

    k= 5 1 2 3 4 5 6
    1 0 5 11 6 10 8 1
    2 4 0 8 3 7 5 2
    D5 = Q5 =
    3 9 6 0 4 8 6 3
    4 5 7 5 0 4 2 4
    5 8 10 5 3 0 5 5
    6 8 10 8 3 6 0 6
    dijk=min(dij(k-1);dik(k-1)+dkj(k-1))

    1 2 3 4 5 6
    - 1 1 1 1 1
    2 - 2 2 2 2
    3 3 - 3 3 3
    4 4 4 - 4 4
    5 5 5 5 - 5
    6 6 6 6 6 -

    1 2 3 4 5 6 1 2
    - 1 1 1 1 1 1 0 0
    2 - 2 2 2 2 2 0 0
    kontrola =
    3 3 - 3 3 3 3 0 0
    4 4 4 - 4 4 4 0 0
    5 5 5 5 - 5 5 0 0
    6 6 6 6 6 - 6 0 0

    1 2 3 4 5 6 1 2
    - 1 2 1 1 1 1 0 0
    2 - 2 2 2 2 2 0 0
    kontrola =
    2 3 - 3 3 3 3 1 0
    4 4 4 - 4 4 4 0 0
    5 5 5 5 - 5 5 0 0
    6 6 6 6 6 - 6 0 0

    1 2 3 4 5 6 1 2
    - 1 2 1 3 3 1 0 0
    2 - 2 2 3 3 2 0 0
    kontrola =
    2 3 - 3 3 3 3 0 0
    kontrola =

    4 4 4 - 4 4 4 0 0
    2 3 5 5 - 5 5 1 1
    2 3 6 6 6 - 6 1 1

    1 2 3 4 5 6 1 2
    - 1 4 1 4 4 1 0 0
    2 - 2 2 4 4 2 0 0
    kontrola =
    4 3 - 3 3 4 3 1 0
    4 4 4 - 4 4 4 0 0
    4 4 5 5 - 4 5 1 1
    4 4 6 6 6 - 6 1 1

    1 2 3 4 5 6 1 2
    - 1 4 1 4 4 1 0 0
    2 - 2 2 4 4 2 0 0
    kontrola =
    4 3 - 3 3 4 3 0 0
    4 4 4 - 4 4 4 0 0
    4 4 5 5 - 4 5 0 0
    4 4 6 6 6 - 6 0 0
    3 4 5 6
    0 0 0 0
    0 0 0 0
    0 0 0 0
    0 0 0 0
    0 0 0 0
    0 0 0 0

    3 4 5 6
    1 0 0 0
    0 0 0 0
    0 0 0 0
    0 0 0 0
    0 0 0 0
    0 0 0 0

    3 4 5 6
    0 0 1 1
    0 0 1 1
    0 0 0 0
    0 0 0 0
    0 0 0 0
    0 0 0 0

    3 4 5 6
    1 0 1 1
    0 0 1 1
    0 0 0 1
    0 0 0 0
    0 0 0 1
    0 0 0 0

    3 4 5 6
    0 0 0 0
    0 0 0 0
    0 0 0 0
    0 0 0 0
    0 0 0 0
    0 0 0 0

    You might also like