How can I represent a graph in Python for Dijkstra's algorithm?

How can I represent a graph in Python for Dijkstra's algorithm?

You can represent a graph using an adjacency list or an adjacency matrix. Which one would you prefer?

I think an adjacency list would be better. Can you show me an example?

Sure! Here's a simple example using a dictionary:

graph = {
    'A': {'B': 1, 'C': 4},
    'B': {'A': 1, 'C': 2, 'D': 5},
    'C': {'A': 4, 'B': 2, 'D': 1},
    'D': {'B': 5, 'C': 1}
}

This represents a graph with nodes A, B, C, and D.

How do I implement Dijkstra's algorithm using this representation?

You can implement Dijkstra's algorithm by using a priority queue to explore the shortest paths. Would you like a code example?

Yes, please provide the code for Dijkstra's algorithm!