Module graph_traversal

Functions

bellman_ford

Performs the Bellman-Ford algorithm to find the shortest paths from the start node to all other nodes in the graph, even when there are negative edge weights.

breadth_first_search

Performs a breadth-first search (BFS) on the given graph starting from the start node.

depth_first_search

Performs a depth-first search (DFS) on the given graph starting from the start node.

dijkstra

Performs Dijkstra’s algorithm to find the shortest path from the start node to all other nodes in the graph.