message: Update path-with-maximum-minimum-value.py
diff: @@ -43,6 +43,9 @@ class Solution(object):
  # Time: O(m * n * log(m * n))
  # Space: O(m * n)
  +import heapq
  +
  +
  # Dijkstra algorithm solution
  class Solution2(object):
  def maximumMinimumPath(self, A):
  