def on_click(): ''' This function defines the action of the 'Next' button. ''' global algo, counter, next_button, romania_problem, start, goal romania_problem = GraphProblem(start.get(), goal.get(), romania_map) if "Breadth-First Tree Search" == algo.get(): node = breadth_first_tree_search(romania_problem) if node is not None: final_path = bfts(romania_problem).solution() final_path.append(start.get()) display_final(final_path) next_button.config(state="disabled") counter += 1 elif "Depth-First Tree Search" == algo.get(): node = depth_first_tree_search(romania_problem) if node is not None: final_path = dfts(romania_problem).solution() final_path.append(start.get()) display_final(final_path) next_button.config(state="disabled") counter += 1 elif "Depth-First Graph Search" == algo.get(): node = depth_first_graph_search(romania_problem) if node is not None: print(node) final_path = dfgs(romania_problem).solution() print(final_path) final_path.append(start.get()) display_final(final_path) next_button.config(state="disabled") counter += 1
def on_click(): ''' This function defines the action of the 'Next' button. ''' global algo, counter, next_button, romania_problem, start, goal romania_problem = GraphProblem(start.get(), goal.get(), romania_map) if "Breadth-First Tree Search" == algo.get(): node = breadth_first_tree_search(romania_problem) if node is not None: final_path = bfts(romania_problem).solution() final_path.append(start.get()) display_final(final_path) next_button.config(state="disabled") counter += 1 elif "Depth-First Tree Search" == algo.get(): node = depth_first_tree_search(romania_problem) if node is not None: final_path = dfts(romania_problem).solution() final_path.append(start.get()) display_final(final_path) next_button.config(state="disabled") counter += 1 elif "Breadth-First Search" == algo.get(): node = breadth_first_search(romania_problem) if node is not None: final_path = bfs(romania_problem).solution() final_path.append(start.get()) display_final(final_path) next_button.config(state="disabled") counter += 1 elif "Depth-First Graph Search" == algo.get(): node = depth_first_graph_search(romania_problem) if node is not None: final_path = dfgs(romania_problem).solution() final_path.append(start.get()) display_final(final_path) next_button.config(state="disabled") counter += 1 elif "Uniform Cost Search" == algo.get(): node = uniform_cost_search(romania_problem) if node is not None: final_path = ucs(romania_problem).solution() final_path.append(start.get()) display_final(final_path) next_button.config(state="disabled") counter += 1 elif "A* - Search" == algo.get(): node = astar_search(romania_problem) if node is not None: final_path = asts(romania_problem).solution() final_path.append(start.get()) display_final(final_path) next_button.config(state="disabled") counter += 1
def on_click(): """ This function defines the action of the 'Next' button. """ global algo, counter, next_button, balige_problem, start, goal balige_problem = GraphProblem(start.get(), goal.get(), map_balige) if "Breadth-First Tree Search" == algo.get(): node = breadth_first_tree_search(balige_problem) if node is not None: final_path = bfts(balige_problem).solution() final_path.append(start.get()) display_final(final_path) next_button.config(state="disabled") counter += 1 elif "Depth-First Tree Search" == algo.get(): node = depth_first_tree_search(balige_problem) if node is not None: final_path = dfts(balige_problem).solution() final_path.append(start.get()) display_final(final_path) next_button.config(state="disabled") counter += 1 elif "Breadth-First Graph Search" == algo.get(): node = breadth_first_graph_search(balige_problem) if node is not None: final_path = bfs(balige_problem).solution() final_path.append(start.get()) display_final(final_path) next_button.config(state="disabled") counter += 1 elif "Depth-First Graph Search" == algo.get(): node = depth_first_graph_search(balige_problem) if node is not None: final_path = dfgs(balige_problem).solution() final_path.append(start.get()) display_final(final_path) next_button.config(state="disabled") counter += 1 elif "Uniform Cost Search" == algo.get(): node = uniform_cost_search(balige_problem) if node is not None: final_path = ucs(balige_problem).solution() final_path.append(start.get()) display_final(final_path) next_button.config(state="disabled") counter += 1 elif "A* - Search" == algo.get(): node = astar_search(balige_problem) if node is not None: final_path = asts(balige_problem).solution() final_path.append(start.get()) display_final(final_path) next_button.config(state="disabled") counter += 1