def test_bellman(): from simple_graph import SimpleGraph new_graph = SimpleGraph() new_graph.graph = {'A': {'B': 5, 'C': 20}, 'B': {'D': 5, 'E': 3}, 'D': {}, 'E': {'F': 13}, 'C': {'F': 16}, 'F': {'A': 100}, } distance, path = new_graph.bellman('A', 'F') assert distance == 21 assert path == ['A', 'B', 'E', 'F']