diff --git a/07_dijkstras_algorithm/python/01_dijkstras_algorithm.py b/07_dijkstras_algorithm/python/01_dijkstras_algorithm.py
index bb0c6db..776eaf5 100644
--- a/07_dijkstras_algorithm/python/01_dijkstras_algorithm.py
+++ b/07_dijkstras_algorithm/python/01_dijkstras_algorithm.py
@@ -61,6 +61,6 @@ while node is not None:
     # Find the next node to process, and loop.
     node = find_lowest_cost_node(costs)
 
-print "Cost from the start to each node:"
-print costs
+print("Cost from the start to each node:")
+print(costs)