def test_neighbors_are_returned_with_the_weight_between_nodes_included():
node_a = Node('a')
node_b = Node('b')
node_c = Node('c')
graph = Graph()
graph.add_node(node_a)
graph.add_node(node_b)
graph.add_node(node_c)
graph.add_edge(node_a,node_b,1)
graph.add_edge(node_a,node_c,2)
assert graph.get_neighbors(node_a) == [{'b': 1}, {'c': 2}]
def test_all_appropriate_neighbors_can_be_retrieved_from_the_graph():
node_a = Node('a')
node_b = Node('b')
node_c = Node('c')
graph = Graph()
graph.add_node(node_a)
graph.add_node(node_b)
graph.add_node(node_c)
graph.add_edge(node_a,node_b,1)
graph.add_edge(node_a,node_c,2)
assert graph.get_neighbors(node_a) == [{'b': 1}, {'c': 2}]
