display best path as result of djikstra's

Author: edabot

Diff for: __pycache__/distance_grid.cpython-36.pyc

@@ -10,7 +10,7 @@ def __init__(self, rows, columns):
         self.distances = {}
 
     def contents_of(self, cell):
-        if self.distances:
+        if self.distances.get(cell) is not None:
             return base36.dumps(self.distances.get(cell))
         else:
-            super
+            return " "

Diff for: __pycache__/distances.cpython-36.pyc

@@ -8,7 +8,24 @@ def get_cells(self):
         return self.cells.keys()
 
     def get(self, cell):
-        return self.cells[cell]
+        if cell in self.cells:
+            return self.cells[cell]
+        else:
+            return None
 
     def set(self, cell, distance):
         self.cells[cell] = distance
+
+    def path_to(self, goal):
+        current = goal
+        breadcrumbs = Distances(self.root)
+        breadcrumbs.cells[current] = self.cells[current]
+
+        while not current == self.root:
+            for neighbor in current.get_links():
+                if self.cells[neighbor] < self.cells[current]:
+                    breadcrumbs.cells[neighbor] = self.cells[neighbor]
+                    current = neighbor
+                    break
+
+        return breadcrumbs

Diff for: distance_grid.py

@@ -4,10 +4,14 @@
 grid = DistanceGrid(12,12)
 BinaryTree.mutate(grid)
 
-start = grid.grid[0][11]
+start = grid.grid[0][0]
+finish = grid.grid[11][0]
 distances = start.distances()
 
 grid.distances = distances
 
 grid.to_string()
-grid.to_grid()
+
+grid.distances = distances.path_to(finish)
+
+grid.to_string()