          print('Success: test_graph')
  
  
  def main():
      test = TestGraph()
      test.test_graph()
      test.test_graph_undirected()
  
 
</s> remove         self.adjacent = OrderedDict()  # key = node, val = weight
 </s> add         self.adjacent = {}  # key = node, val = weight </s> remove         self.nodes = OrderedDict()  # key = node id, val = node
 </s> add         self.nodes = {}  # key = node id, val = node
    def test_graph_undirected(self):
        graph = self.create_graph()

        graph.add_undirected_edge(0, 1, weight=5)
        graph.add_undirected_edge(0, 5, weight=2)
        graph.add_undirected_edge(1, 2, weight=3)

        assert_equal(graph.nodes[0].adjacent[graph.nodes[1]], 5)
        assert_equal(graph.nodes[1].adjacent[graph.nodes[0]], 5)
        assert_equal(graph.nodes[0].adjacent[graph.nodes[5]], 2)
        assert_equal(graph.nodes[5].adjacent[graph.nodes[0]], 2)
        assert_equal(graph.nodes[1].adjacent[graph.nodes[2]], 3)
        assert_equal(graph.nodes[2].adjacent[graph.nodes[1]], 3)

        print('Success: test_graph')

          print('Success: test_graph')
  
    def test_graph_undirected(self):
        graph = self.create_graph()

        graph.add_undirected_edge(0, 1, weight=5)
        graph.add_undirected_edge(0, 5, weight=2)
        graph.add_undirected_edge(1, 2, weight=3)

        assert_equal(graph.nodes[0].adjacent[graph.nodes[1]], 5)
        assert_equal(graph.nodes[1].adjacent[graph.nodes[0]], 5)
        assert_equal(graph.nodes[0].adjacent[graph.nodes[5]], 2)
        assert_equal(graph.nodes[5].adjacent[graph.nodes[0]], 2)
        assert_equal(graph.nodes[1].adjacent[graph.nodes[2]], 3)
        assert_equal(graph.nodes[2].adjacent[graph.nodes[1]], 3)

        print('Success: test_graph')

  
  def main():
      test = TestGraph()
      test.test_graph()
      test.test_graph_undirected()
  
keep add keep keep keep keep keep keep
 Rework graph challenge and solution (#86) 
graphs_trees/graph/test_graph.py