Python Code Snippet: Shortest Path Algorithm - كتاب الذكاء الإصطناعي - الصف 12 - الفصل 1 - المملكة العربية السعودية

shortest_distance[start_cell] = 0 # remembers the direct parent of each cell on the shortest path from the start_cell to the cell parent = {} #the parent of the start cell is itself parent[start_cell] = start_cell while len(to_expand)>0: next_cell = to_expand.pop(0) # get the next cell and remove it from the expansion list if verbose: print('\nExpanding cell', next_cell) # for each neighbor of this cell for neighbor,cost in get_neighbors(maze, next_cell): if verbose: print('\tVisiting neighbor cell',neighbor) cell_visits+=1 if neighbor not in visited: # if this is the first time this neighbor is visited visited.add(neighbor) to_expand.append(neighbor) parent[neighbor] = next_cell shortest_distance[neighbor]=shortest_distance[next_cell]+cost # target reached if neighbor==target_cell: # get the shortest path to the target cell, reconstructed in reverse. shortest_path = reconstruct_shortest_path(parent, start_cell, target_cell) return shortest_path, shortest_distance[target_cell],cell_visits else: # this neighbor has been visited before # if the current shortest distance to the neighbor is longer than the shortest # distance to next_cell plus the cost of transitioning from next_cell to this neighbor if shortest_distance[neighbor]>shortest_distance[next_cell] +cost: parent[neighbor]=next_cell shortest_distance[neighbor]=shortest_distance[next_cell]+cost # search complete but the target was never reached, no path exists return None,None,None وزارة التعليم Ministry of Education 2023 - 1447 113 --- VISUAL CONTEXT --- **IMAGE**: Ministry of Education Logo Description: A logo consisting of several green dots arranged in a pattern, with Arabic and English text below it. Context: Indicates the source or publisher of the educational material.