Update dijkstra_algorithm.py

Author: MaximSmolskiy

graphs/dijkstra_algorithm.py

@@ -118,7 +118,7 @@ def extract_min(self):
         >>> priority_queue_test.extract_min()
         'C'
         >>> priority_queue_test.array[0]
-        (15, 'B')
+        (10, 'A')
         """
         min_node = self.array[0][1]
         self.array[0] = self.array[self.cur_size - 1]