ollien
/
advent-of-code-2019
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Minor reshuffling in day 15

master
Nick Krichevsky 2019-12-15 20:33:29 -05:00
parent 66228b9663
commit 16a8d2597c
1 changed files with 37 additions and 37 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

74
day15/py/main.py
View File

@ -290,43 +290,6 @@ def build_graph_with_dfs(memory: Memory, root: Node) -> None:
dfs(root)
# A debug method that uses dfs to print the entire maze graph
def print_graph(root: Node):
nodes = {}
visited = set()
to_visit = [root]
while len(to_visit) > 0:
node = to_visit.pop()
if node in visited:
continue
visited.add(node)
nodes[(node.row, node.col)] = node
for neighbor in node.neighbors.values():
to_visit.append(neighbor)
max_col = max(coord[0] for coord in nodes)
max_row = max(coord[1] for coord in nodes)
min_col = min(coord[0] for coord in nodes)
min_row = min(coord[1] for coord in nodes)
for i in range(min_row, max_row+1):
for j in range(min_col, max_col+1):
if (i, j) == (0, 0):
print('!', end='')
if (i, j) not in nodes:
print('?', end='')
continue
node = nodes[(i, j)]
if node.node_type == Node.Type.TARGET:
print('x', end='')
elif node.node_type == Node.Type.WALL:
print('#', end='')
else:
print(' ', end='')
print('')
# Find the distance to all nodes in the graph, returning a set of the nodes explored
def populate_graph_distances(root: Node) -> Set[Node]:
root.distance = 0
@ -390,6 +353,43 @@ def part2(all_nodes: Iterable[Node]) -> int:
return minutes
# A debug method that uses dfs to print the entire maze graph
def print_graph(root: Node):
nodes = {}
visited = set()
to_visit = [root]
while len(to_visit) > 0:
node = to_visit.pop()
if node in visited:
continue
visited.add(node)
nodes[(node.row, node.col)] = node
for neighbor in node.neighbors.values():
to_visit.append(neighbor)
max_col = max(coord[0] for coord in nodes)
max_row = max(coord[1] for coord in nodes)
min_col = min(coord[0] for coord in nodes)
min_row = min(coord[1] for coord in nodes)
for i in range(min_row, max_row+1):
for j in range(min_col, max_col+1):
if (i, j) == (0, 0):
print('!', end='')
if (i, j) not in nodes:
print('?', end='')
continue
node = nodes[(i, j)]
if node.node_type == Node.Type.TARGET:
print('x', end='')
elif node.node_type == Node.Type.WALL:
print('#', end='')
else:
print(' ', end='')
print('')
if __name__ == "__main__":
if len(sys.argv) != 2:
# Today's part 2 produces a lot of output, so i wanted to keep them separate