def test_0_execute(self):
path1 = Wirepath()
path1.set_wires(["R8", "U5", "L5", "D3"])
path2 = Wirepath()
path2.set_wires(["U7", "R6", "D4", "L4"])
solution = GridSolver.find_shortest_path_distance_node(path1, path2)
self.assertEqual(30, solution)
def test_1_execute(self):
path1 = Wirepath()
path1.set_wires(
["R75", "D30", "R83", "U83", "L12", "D49", "R71", "U7", "L72"])
path2 = Wirepath()
path2.set_wires(
["U62", "R66", "U55", "R34", "D71", "R55", "D58", "R83"])
solution = GridSolver.find_shortest_path_distance_node(path1, path2)
self.assertEqual(610, solution)
def solve_cable_routing():
with open("input.txt") as file:
content = file.readlines()
content = [x.strip() for x in content]
path1 = Wirepath()
path1.set_wires(content[0].split(","))
path2 = Wirepath()
path2.set_wires(content[1].split(","))
solution = GridSolver.find_shortest_manhattan_distance_node(path1, path2)
print("Closest intersection has distance of", solution)
def test_2_execute(self):
path1 = Wirepath()
path1.set_wires([
"R98", "U47", "R26", "D63", "R33", "U87", "L62", "D20", "R33",
"U53", "R51"
])
path2 = Wirepath()
path2.set_wires([
"U98", "R91", "D20", "R16", "D67", "R40", "U7", "R15", "U6", "R7"
])
solution = GridSolver.find_shortest_path_distance_node(path1, path2)
self.assertEqual(410, solution)