How can I implement Dijkstra's algorithm in Python?

How can I implement Dijkstra's algorithm in Python?

You can implement Dijkstra's algorithm using a priority queue. Would you like a step-by-step guide?

Yes, please provide the steps.

1. Create a graph representation (like an adjacency list).
2. Initialize distances and a priority queue.
3. Update distances based on the shortest path.
4. Repeat until all nodes are processed.

Can you show me a sample code for that?

Sure! Here's a simple implementation:

import heapq

def dijkstra(graph, start):
    queue = [(0, start)]
    distances = {node: float('infinity') for node in graph}
    distances[start] = 0

    while queue:
        current_distance, current_node = heapq.heappop(queue)

        if current_distance > distances[current_node]:
            continue

        for neighbor, weight in graph[current_node].items():
            distance = current_distance + weight

            if distance < distances[neighbor]:
                distances[neighbor] = distance
                heapq.heappush(queue, (distance, neighbor))

    return distances

What kind of graph can I use with this implementation?

You can use any weighted graph, represented as an adjacency list, where each node points to its neighbors with their respective weights.