plais/advent-of-code-2021
1
0
Fork 0
Code Projects Releases Activity

Update day 12 solution
All checks were successful
continuous-integration/drone/push Build is passing
Details

Browse Source 
Use deque instead of list
This commit is contained in:
Pascal Lais
2021-12-13 08:54:11 +01:00
parent 5995599d6d
commit a70226032b
1 changed files with 11 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
day-12/day-12.py
View File

@@ -1,11 +1,12 @@
#!/usr/bin/env python3 #!/usr/bin/env python3
from pathlib import Path from pathlib import Path
from collections import deque
def process_node(node, available_edges, visited): def process_node(node, available_edges, visited):
paths = [] paths = deque()
if node == "end": if node == "end":
paths.append([node]) paths.append(deque(node))
return paths return paths
if node.islower(): if node.islower():
visited.add(node) visited.add(node)
@@ -13,16 +14,18 @@ def process_node(node, available_edges, visited):
for n in neighbors: for n in neighbors:
if n not in visited: if n not in visited:
nxt = process_node(n, available_edges, visited) nxt = process_node(n, available_edges, visited)
paths += [[node] + p for p in nxt] for p in nxt:
p.appendleft(node)
paths.append(p)
if node in visited: if node in visited:
visited.remove(node) visited.remove(node)
return paths return paths
def process_node_twice(node, available_edges, visited, visited_twice): def process_node_twice(node, available_edges, visited, visited_twice):
paths = [] paths = deque()
if node == "end": if node == "end":
paths.append([node]) paths.append(deque(node))
return paths return paths
if node.islower(): if node.islower():
if node in visited and visited_twice: if node in visited and visited_twice:
@@ -35,7 +38,9 @@ def process_node_twice(node, available_edges, visited, visited_twice):
for n in neighbors: for n in neighbors:
if n not in visited or visited_twice != node and n != "start": if n not in visited or visited_twice != node and n != "start":
nxt = process_node_twice(n, available_edges, visited, visited_twice) nxt = process_node_twice(n, available_edges, visited, visited_twice)
paths += [[node] + p for p in nxt] for p in nxt:
p.appendleft(node)
paths.append(p)
if visited_twice == node: if visited_twice == node:
visited_twice = None visited_twice = None
elif node in visited: elif node in visited: