      "        print('Success: test_graph')\n",
      "\n",
      "    def test_graph_undirected(self):\n",
      "        graph = self.create_graph()\n",
      "\n",
      "        graph.add_undirected_edge(0, 1, weight=5)\n",
      "        graph.add_undirected_edge(0, 5, weight=2)\n",
      "        graph.add_undirected_edge(1, 2, weight=3)\n",
      "\n",
      "        assert_equal(graph.nodes[0].adjacent[graph.nodes[1]], 5)\n",
 
</s>
      "        print('Success: test_graph')\n",
      "\n",
      "    def test_graph_undirected(self):\n",
      "        graph = self.create_graph()\n",

      "        graph.add_undirected_edge(0, 1, weight=5)\n",
      "        graph.add_undirected_edge(0, 5, weight=2)\n",
      "        graph.add_undirected_edge(1, 2, weight=3)\n",
      "\n",
      "        assert_equal(graph.nodes[0].adjacent[graph.nodes[1]], 5)\n",
keep keep keep keep replace keep keep keep keep keep
 Rework graph challenge and solution (#90)
graphs_trees/graph/graph_solution.ipynb