# Read from file
file = open(input_file, "r")
for line in file:
edge = line.split()
graph.add_vertex(edge[0])
graph.add_vertex(edge[1])
graph.add_edge(edge[0], edge[1], int(edge[2]))
file.close()
# Perform search
searcher = Searcher(graph)
try:
result = []
if search_type == "BFS":
result = searcher.breadth_first_search(start_node, end_node)
elif search_type == "DFS":
result = searcher.depth_first_search(start_node, end_node)
elif search_type == "UCS":
result = searcher.dijkstra_search(start_node, end_node)
# Write result to file
file = open(output_file, "w")
for node in result[0]:
file.write(node + "\n")
file.close()
except NoGraphPathException:
file = open(output_file, "w")
file.write("")
file.close()
