Little fixes

Author: davecom

Chapter9/knapsack.py

@@ -27,13 +27,13 @@ def knapsack(items: List[Item], max_capacity: int) -> List[Item]:
     table: List[List[float]] = [[0.0 for _ in range(max_capacity + 1)] for _ in range(len(items) + 1)]
     for i, item in enumerate(items):
         for capacity in range(1, max_capacity + 1):
-            previous_item_value = table[i][capacity]
+            previous_items_value: float = table[i][capacity]
             if capacity >= item.weight: # item fits in knapsack
-                value_freeing_weight_for_item = table[i][capacity - item.weight]
+                value_freeing_weight_for_item: float = table[i][capacity - item.weight]
                 # only take if more valuable than previous item
-                table[i + 1][capacity] = max(value_freeing_weight_for_item + item.value, previous_item_value)
+                table[i + 1][capacity] = max(value_freeing_weight_for_item + item.value, previous_items_value)
             else: # no room for this item
-                table[i + 1][capacity] = previous_item_value
+                table[i + 1][capacity] = previous_items_value
     # figure out solution from table
     solution: List[Item] = []
     capacity = max_capacity

Chapter9/tsp.py

@@ -13,8 +13,8 @@
 # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 # See the License for the specific language governing permissions and
 # limitations under the License.
+from typing import Dict, List, Iterable, Tuple
 from itertools import permutations
-from typing import Dict, List, Iterable, Tuple, Any
 
 vt_distances: Dict[str, Dict[str, int]] = {
     "Rutland":
@@ -50,7 +50,7 @@
 
 if __name__ == "__main__":
     best_path: Tuple[str, ...]
-    min_distance: int = 99999999999 # arbitrarily high nubmer
+    min_distance: int = 99999999999 # arbitrarily high number
     for path in tsp_paths:
         distance: int = 0
         last: str = path[0]