<prompt> Kuandika dijkstra ya algorithm katika Python.  <response>: Here is an implementation of Dijkstras Algorithm in Python:import heapqdef dijkstragraph, start: distances node: floatinf for node in graph distancesstart 0 heap 0, start visited set while heap: current_distance, current_node heapq.heappopheap if current_node in visited: continue visited.addcurrent_node for neighbor, weight in graphcurrent_node.items: distance current_distance weight if distance distancesneighbor: distancesneighbor distance heapq.heappushheap, distance, neighbor return distances 