      "        return graph\n",
      "\n",
      "    def test_graph(self):\n",
      "        graph = self.create_graph()\n",
      "\n",
      "        graph.add_edge(0, 1, weight=5)\n",
      "        graph.add_edge(0, 5, weight=2)\n",
      "        graph.add_edge(1, 2, weight=3)\n",
      "        graph.add_edge(2, 3, weight=4)\n",
      "        graph.add_edge(3, 4, weight=5)\n",
 
</s>
      "        return graph\n",
      "\n",
      "    def test_graph(self):\n",
      "        graph = self.create_graph()\n",

      "        graph.add_edge(0, 1, weight=5)\n",
      "        graph.add_edge(0, 5, weight=2)\n",
      "        graph.add_edge(1, 2, weight=3)\n",
      "        graph.add_edge(2, 3, weight=4)\n",
      "        graph.add_edge(3, 4, weight=5)\n",
keep keep keep keep replace keep keep keep keep keep
 Rework graph challenge and solution (#90)
graphs_trees/graph/graph_solution.ipynb