diff --git a/chapter9/with_heap/ex171a.py b/chapter9/with_heap/ex171a.py
index 73711ea..36b2f03 100644
--- a/chapter9/with_heap/ex171a.py
+++ b/chapter9/with_heap/ex171a.py
@@ -23,6 +23,7 @@ def dijkstra(graph, node):
 
     while queue:
         current_cost, current_node = heapq.heappop(queue)
+        logger.debug(f"node {current_node} with cost {current_cost} popped from pqueue")
 
         for next_node, weight in graph[current_node].items():
             new_cost = current_cost + weight
@@ -30,12 +31,15 @@ def dijkstra(graph, node):
                 costs[next_node] = new_cost
                 parents[next_node] = current_node
                 heapq.heappush(queue, (new_cost, next_node))
+                logger.debug(
+                    f"node {next_node} with new cost {new_cost} appended to pqueue"
+                )
     return costs, parents
 
 
 costs, parents = dijkstra(graph, "start")
 
-print(f"lowest cost route: {costs['fin']}")
+print(f"lowest cost from start to fin: {costs['fin']}")
 
 
 def get_full_route():
@@ -48,4 +52,4 @@ def get_full_route():
     return list(reversed(route))
 
 
-print(f"route: {get_full_route()}")
+print(f"full route: {get_full_route()}")
diff --git a/chapter9/with_heap/ex171b.py b/chapter9/with_heap/ex171b.py
index 191b0ba..e6551a6 100644
--- a/chapter9/with_heap/ex171b.py
+++ b/chapter9/with_heap/ex171b.py
@@ -22,6 +22,7 @@ def dijkstra(graph, node):
 
     while queue:
         current_cost, current_node = heapq.heappop(queue)
+        logger.debug(f"node {current_node} with cost {current_cost} popped from pqueue")
 
         for next_node, weight in graph[current_node].items():
             new_cost = current_cost + weight
@@ -29,8 +30,12 @@ def dijkstra(graph, node):
                 costs[next_node] = new_cost
                 parents[next_node] = current_node
                 heapq.heappush(queue, (new_cost, next_node))
+                logger.debug(
+                    f"node {next_node} with new cost {new_cost} appended to pqueue"
+                )
     return costs, parents
 
 
 costs, parents = dijkstra(graph, "start")
-print(f"lowest cost route: {costs['fin']}")
+
+print(f"lowest cost from start to fin: {costs['fin']}")
diff --git a/chapter9/with_heap/ex171c.py b/chapter9/with_heap/ex171c.py
index fb70265..00e17ac 100644
--- a/chapter9/with_heap/ex171c.py
+++ b/chapter9/with_heap/ex171c.py
@@ -22,6 +22,7 @@ def dijkstra(graph, node):
 
     while queue:
         current_cost, current_node = heapq.heappop(queue)
+        logger.debug(f"node {current_node} with cost {current_cost} popped from pqueue")
 
         for next_node, weight in graph[current_node].items():
             new_cost = current_cost + weight
@@ -29,9 +30,12 @@ def dijkstra(graph, node):
                 costs[next_node] = new_cost
                 parents[next_node] = current_node
                 heapq.heappush(queue, (new_cost, next_node))
+                logger.debug(
+                    f"node {next_node} with new cost {new_cost} appended to pqueue"
+                )
     return costs, parents
 
 
 costs, parents = dijkstra(graph, "start")
 
-print(f"lowest cost route: {costs['fin']}")
+print(f"lowest cost from start to fin: {costs['fin']}")