The below python code has no output , correct the code to see the output :

class Node: def __init__(self, location): self.location = location self.neighbors = [] self.visited = False # Track visited nodes for cycle detection self.distance = float('inf') # Store distance from starting node

# Create nodes for each location locations = { "A": Node("A"), "B": Node("B"), "C": Node("C"), "D": Node("D"), "E": Node("E"), } # Add edges with travel time locations["A"].neighbors.append((locations["B"], 5)) locations["A"].neighbors.append((locations["C"], 10)) locations["B"].neighbors.append((locations["D"], 15)) locations["B"].neighbors.append((locations["E"], 20)) locations["C"].neighbors.append((locations["D"], 7)) locations["C"].neighbors.append((locations["E"], 12)) locations["D"].neighbors.append((locations["E"], 3))

def is_visited(node): return node.visited def visit_node(node): node.visited = True def unvisit_node(node): node.visited = False def has_cycle(start_node): stack = [start_node]

while stack: current_node = stack.pop()

if is_visited(current_node): return True # Cycle detected, already visited

visit_node(current_node)

for neighbor, _ in current_node.neighbors: if not is_visited(neighbor): stack.append(neighbor)

unvisit_node(current_node)

return False # No cycle found

1- Use any online compiler

2- share screenshot for the output