What are some common graph algorithms in Python?

What are some common graph algorithms in Python?

Some common graph algorithms in Python include Dijkstra's algorithm, A* search, and Depth-First Search (DFS). Would you like to know more about any specific one?

Can you explain Dijkstra's algorithm?

Dijkstra's algorithm finds the shortest path from a starting node to all other nodes in a weighted graph. It uses a priority queue to explore the nearest unvisited node.

How can I implement it in Python?

You can implement Dijkstra's algorithm using a priority queue from the heapq module. Would you like to see a code example?

Yes, please provide a code example.

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

This function takes a graph represented as a dictionary and a starting node.