def test_node_collection(): graph = Graph() a = graph.add_node('a') b = graph.add_node('b') c = graph.add_node('c') actual = graph.get_nodes() assert actual == [a, b, c]
def test_get_neighbors_none(): graph = Graph() a = graph.add_node('a') b = graph.add_node('b') c = graph.add_node('c') actual = graph.get_neighbors(a) assert actual == []
def test_get_neighbors(): graph = Graph() a = graph.add_node('a') b = graph.add_node('b') c = graph.add_node('c') e_1 = graph.add_edge(a, b, 2) e_2 = graph.add_edge(a, c, 2) actual = graph.get_neighbors(a) assert actual == [e_1, e_2]
def test_get_neighbors_weight(): graph = Graph() a = graph.add_node('a') b = graph.add_node('b') c = graph.add_node('c') e_1 = graph.add_edge(a, b, 3) e_2 = graph.add_edge(a, c, 4) neighbor_1 = graph.get_neighbors(a)[0] neighbor_2 = graph.get_neighbors(a)[1] assert neighbor_1.weight == 3 and neighbor_2.weight == 4
def test_empty_graph(): graph = Graph() actual = graph.get_nodes() assert actual == None
def test_one_node_one_edge(): graph = Graph() a = graph.add_node('a') edge = graph.add_edge(a, a) actual = graph.get_neighbors(a) assert actual == [edge]
def test_graph_size(): graph = Graph() a = graph.add_node('a') b = graph.add_node('b') actual = graph.size() assert actual == 2
def test_add_node_to_graph(): graph = Graph() actual = graph.add_node('a').value expected = 'a' assert actual == expected
def test_add_edge_to_graph(): graph = Graph() a = graph.add_node('a') b = graph.add_node('b') graph.add_edge(a, b) assert True
def flights(): graph = Graph() pandora = graph.add_node("pandora") arendelle = graph.add_node("arendelle") metroville = graph.add_node("metroville") monstropolis = graph.add_node("monstropolis") narnia = graph.add_node("narnia") naboo = graph.add_node("naboo") graph.add_edge(pandora, arendelle, 150) graph.add_edge(pandora, metroville, 82) graph.add_edge(arendelle, metroville, 99) graph.add_edge(arendelle, monstropolis, 42) graph.add_edge(metroville, monstropolis, 105) graph.add_edge(metroville, naboo, 26) graph.add_edge(metroville, narnia, 37) graph.add_edge(metroville, pandora, 82) graph.add_edge(monstropolis, naboo, 73) graph.add_edge(narnia, naboo, 250) return [graph, pandora, narnia, arendelle, metroville, monstropolis, naboo]
def test_graph_empty(): graph = Graph() routes = [] actual = get_edge(graph, routes) assert actual == (False, 0)