Scribd Logo
Hochladen

Willkommen bei Scribd!

  • Sibiu Timisoara: Level Open List Goal/Test Close List

    Hochgeladen von

    Ercherio Marpaung
    16 Ansichten2 Seiten
    The document describes two graph search algorithms, depth-first search (DFS) and breadth-first search (BFS), being applied to find the shortest path from Arad to Bucharest in a road network graph. DFS finds the path in 7 steps through the nodes of Arad, Zerind, Oradea, Sibiu, Rimnicu Vilcea, Pitesti and Bucharest. BFS finds the shortest path of 211 units in 4 levels through the nodes of Arad, Timisoara, Sibiu, Oradea, Rimnicu Vilcea, Fagaras, Pitesti, Craiova and Bucharest.

    Originalbeschreibung:

    Tugas

    Originaltitel

    Tugas Tree

    Copyright

    © © All Rights Reserved

    Verfügbare Formate

    DOCX, PDF, TXT oder online auf Scribd lesen

    Stufen Sie dieses Dokument als nützlich ein?

    Sind diese Inhalte unangemessen?

    Dieses Dokument melden
    The document describes two graph search algorithms, depth-first search (DFS) and breadth-first search (BFS), being applied to find the shortest path from Arad to Bucharest in a road network graph. DFS finds the path in 7 steps through the nodes of Arad, Zerind, Oradea, Sibiu, Rimnicu Vilcea, Pitesti and Bucharest. BFS finds the shortest path of 211 units in 4 levels through the nodes of Arad, Timisoara, Sibiu, Oradea, Rimnicu Vilcea, Fagaras, Pitesti, Craiova and Bucharest.

    Copyright:

    © All Rights Reserved
    Als DOCX, PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    16 Ansichten2 Seiten

    Sibiu Timisoara: Level Open List Goal/Test Close List

    Hochgeladen von

    Ercherio Marpaung
    The document describes two graph search algorithms, depth-first search (DFS) and breadth-first search (BFS), being applied to find the shortest path from Arad to Bucharest in a road network graph. DFS finds the path in 7 steps through the nodes of Arad, Zerind, Oradea, Sibiu, Rimnicu Vilcea, Pitesti and Bucharest. BFS finds the shortest path of 211 units in 4 levels through the nodes of Arad, Timisoara, Sibiu, Oradea, Rimnicu Vilcea, Fagaras, Pitesti, Craiova and Bucharest.

    Copyright:

    © All Rights Reserved
    Als DOCX, PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    von 2

    DFS

    Arad

    Sibiu Timisoara Zerind

    140 = 0+140 118 = 0+118 75 = 0+75

    Oradea

    146 = 71+75

    Sibiu

    297 = 145+146

    Rimnicu Fagaras
    Vilcea

    377 = 80+297 396 = 99+297

    Pitesti

    474 = 97+377

    Bucharest

    685 = 101+474

    DFS
    Level Open List Goal/Test Close List
    1 Arad No Arad
    2 Zerind No Zerind
    3 Orodea No Orodea
    4 Sibiu No Sibiu
    5 Rimnicu Vilcea No Rimnicu
    6 Pitesti No Pitesti
    7 Bucharest Yes
    BFS
    Arad

    Sibiu Timisoara Zerind

    140 = 0+140 118 = 0+118 75 = 0+75

    Fagaras Rimnicu
    Vilcea

    239 = 99+140

    Bucharest

    BFS
    Level Open List Goal/Test Close List Jarak
    1 Arad No Arad 0
    Zerind No Zerind 75
    2 Timnisoara No Timnisoara 118
    Sibiu No Sibiu 140
    Orodea No Orodea 71
    Lugoj No Lugoi 111
    3
    Rimnicu No Rimnicu 80
    Fagaras No Fagaras 99
    Mehadia No Mehadira 70
    Pitesti No Pitesti 97
    4
    Craiova No Craiova 146
    Bucharest Yes 211

    Jalur terdekat BFS dari Arad ke


    Ket : Bucharest

    Das könnte Ihnen auch gefallen