day12: reorder function defs

Author: tfaughnan

day12/1.py

@@ -8,6 +8,20 @@ def edges(graph, coord):
     return (n for n in ((r - 1, c), (r + 1, c), (r, c - 1), (r, c + 1))
             if n in graph and graph[n] - graph[coord] <= 1)
 
+def shortest_path(graph, start, end):
+    to_explore = deque([(start, 0)])
+    explored = set()
+    while to_explore:
+        here, steps = to_explore.popleft()
+        if here == end:
+            return steps
+        for neighbor in edges(graph, here):
+            if neighbor not in explored:
+                explored.add(neighbor)
+                to_explore.append((neighbor, steps + 1))
+
+    raise ValueError('No paths exist!')
+
 def main():
     graph = {}
     start = None
@@ -26,19 +40,5 @@ def main():
     steps = shortest_path(graph, start, end)
     print(steps)
 
-def shortest_path(graph, start, end):
-    to_explore = deque([(start, 0)])
-    explored = set()
-    while to_explore:
-        here, steps = to_explore.popleft()
-        if here == end:
-            return steps
-        for neighbor in edges(graph, here):
-            if neighbor not in explored:
-                explored.add(neighbor)
-                to_explore.append((neighbor, steps + 1))
-
-    raise ValueError('No paths exist!')
-
 if __name__ == '__main__':
     main()

day12/2.py

@@ -9,6 +9,20 @@ def edges(graph, coord):
     return (n for n in ((r - 1, c), (r + 1, c), (r, c - 1), (r, c + 1))
             if n in graph and graph[coord] - graph[n] <= 1)
 
+def shortest_path_to_height(graph, start, height):
+    to_explore = deque([(start, 0)])
+    explored = set()
+    while to_explore:
+        here, steps = to_explore.popleft()
+        if graph[here] == height:
+            return steps
+        for neighbor in edges(graph, here):
+            if neighbor not in explored:
+                explored.add(neighbor)
+                to_explore.append((neighbor, steps + 1))
+
+    raise ValueError('No paths exist!')
+
 def main():
     graph = {}
     end = None
@@ -25,19 +39,5 @@ def main():
     steps = shortest_path_to_height(graph, end, ord('a'))
     print(steps)
 
-def shortest_path_to_height(graph, start, height):
-    to_explore = deque([(start, 0)])
-    explored = set()
-    while to_explore:
-        here, steps = to_explore.popleft()
-        if graph[here] == height:
-            return steps
-        for neighbor in edges(graph, here):
-            if neighbor not in explored:
-                explored.add(neighbor)
-                to_explore.append((neighbor, steps + 1))
-
-    raise ValueError('No paths exist!')
-
 if __name__ == '__main__':
     main()