Скачать или смотреть BFS find the shortest path of weighted directed graph | Breadth First Search

Solution BFS
https://algopk.com/2022/09/17/breath-...

Directed weighted Graph



Question 1: Search
Transport for London helpfully provides visitors with a map that shows walking times between stations on the London Underground: see http://content.tfl_gov.ukiwalking-tube-rnap_pcif. Suppose you are doing research for a book on the architecture of Underground stations, and your task for today requires you to walk from Tottenham Court. Road to Kings Cross St Pancras, following the routes of the Underground lines to ensure you walk past each station on your chosen route. You may take whichever route you prefer, and for the purposes of this question it is assumed you favour the fastest route. When answering parts (c) and (d) below, you should briefly describe each algorithm and show the contents of the open list at each step from the start state until a goal state is found.
b. Write a problem formulation for the activity described above, including precise descriptions of the initial state, the actions available at each state, a goal test and a path cost function. Note that you are only required to specify the actions available at stations that feature in the search trees you construct in your answers to parts (c) and (d) below.
VI marks]
c. Show how the quickest route will be calculated by each of the following search strategies:
L Breadth-first search ii. Depth-first search with iterative deepening iii. Uniform-cost search
[12 marks]
Now find the fastest walking time from each relevant station to Kings Cross using an online application such as htip:ilwalkit..comi. Show a list of these timings and use them as a heuristic to determine the route that will be calculated by the A4 algorithm_
[16 marks]
#bfs
#algorithm
#algorithms
#Breath First Search
#searching
#DSA
#data structures
#BFS