def test_graph_no_edges(): graph = Graph() lst = ['apple', 'banana', 'cantelope'] # add all nodes graph.add_node('apple') graph.add_node('banana') graph.add_node('cantelope') graph.add_node('dates') graph.add_node('eggplant') graph.add_node('figs') assert get_edge(graph, lst) == 'False : $0'
def test_get_edge(): cities = [ 'Pandora', 'Metroville', 'Narnia', ] graph = Graph() graph.add_node('Pandora') graph.add_node('Metroville') graph.add_node('Narnia') graph.add_node('Naboo') graph.add_node('Arendelle') graph.add_node('Monstropolis') assert get_edge(graph, cities) == (0, False) graph.add_edge('Pandora', 'Arendelle', 150) graph.add_edge('Pandora', 'Metroville', 82) graph.add_edge('Metroville', 'Narnia', 37) assert get_edge(graph, cities) == (True, 119) places = ['Monstropolis', 'Narnia'] assert get_edge(graph, places) == (0, False) graph.add_edge('Monstropolis', 'Narnia', 210) assert get_edge(graph, places) == (True, 210)
def test_one_city(made_graph): lst = ['apple'] assert get_edge(made_graph, lst) == 'False : $0'
def test_graph_with_correct_edges(made_graph): lst = ['apple', 'banana', 'cantelope', 'dates', 'eggplant', 'figs'] assert get_edge(made_graph, lst) == 'True : $121'
def test_city_not_in_graph(made_graph): graph = made_graph lst = ['apple', 'banana', 'watermellon'] assert get_edge(graph, lst) == 'False : $0'
def test_cities_empty(made_graph): graph = made_graph lst = [] assert get_edge(graph, lst) == 'False : $0'
def test_graph_empty(): graph = Graph() lst = ['a', 'b', 'c'] assert get_edge(graph, lst) == 'False : $0'