      def test_graph(self):
          graph = Graph()
          for id in range(0, 6):
              graph.add_node(id)
          graph.add_edge(0, 1, 5)
          graph.add_edge(0, 5, 2)
          graph.add_edge(1, 2, 3)
          graph.add_edge(2, 3, 4)
          graph.add_edge(3, 4, 5)
          graph.add_edge(3, 5, 6)
          graph.add_edge(4, 0, 7)
          graph.add_edge(5, 4, 8)
          graph.add_edge(5, 2, 9)
  
          assert_equal(graph.nodes[0].adjacent[graph.nodes[1]], 5)
          assert_equal(graph.nodes[0].adjacent[graph.nodes[5]], 2)
          assert_equal(graph.nodes[1].adjacent[graph.nodes[2]], 3)
          assert_equal(graph.nodes[2].adjacent[graph.nodes[3]], 4)
 
</s> remove     "        graph.add_edge(0, 1, 5)\n",
    "        graph.add_edge(0, 5, 2)\n",
    "        graph.add_edge(1, 2, 3)\n",
    "        graph.add_edge(2, 3, 4)\n",
    "        graph.add_edge(3, 4, 5)\n",
    "        graph.add_edge(3, 5, 6)\n",
    "        graph.add_edge(4, 0, 7)\n",
    "        graph.add_edge(5, 4, 8)\n",
    "        graph.add_edge(5, 2, 9)\n",
 </s> add     "        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",
    "        graph.add_edge(3, 5, weight=6)\n",
    "        graph.add_edge(4, 0, weight=7)\n",
    "        graph.add_edge(5, 4, weight=8)\n",
    "        graph.add_edge(5, 2, weight=9)\n", </s> remove     "        graph.add_edge(0, 1, 5)\n",
    "        graph.add_edge(0, 5, 2)\n",
    "        graph.add_edge(1, 2, 3)\n",
    "        graph.add_edge(2, 3, 4)\n",
    "        graph.add_edge(3, 4, 5)\n",
    "        graph.add_edge(3, 5, 6)\n",
    "        graph.add_edge(4, 0, 7)\n",
    "        graph.add_edge(5, 4, 8)\n",
    "        graph.add_edge(5, 2, 9)\n",
 </s> add     "        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",
    "        graph.add_edge(3, 5, weight=6)\n",
    "        graph.add_edge(4, 0, weight=7)\n",
    "        graph.add_edge(5, 4, weight=8)\n",
    "        graph.add_edge(5, 2, weight=9)\n", </s> remove     def test_graph(self):
 </s> add     def create_graph(self): </s> remove     "    def test_graph(self):\n",
 </s> add     "    def create_graph(self):\n",
        return graph

    def test_graph(self):
        graph = self.create_graph()

        graph.add_edge(0, 1, weight=5)
        graph.add_edge(0, 5, weight=2)
        graph.add_edge(1, 2, weight=3)
        graph.add_edge(2, 3, weight=4)
        graph.add_edge(3, 4, weight=5)
        graph.add_edge(3, 5, weight=6)
        graph.add_edge(4, 0, weight=7)
        graph.add_edge(5, 4, weight=8)
        graph.add_edge(5, 2, weight=9)
      def test_graph(self):
          graph = Graph()
          for id in range(0, 6):
              graph.add_node(id)
        return graph

    def test_graph(self):
        graph = self.create_graph()

        graph.add_edge(0, 1, weight=5)
        graph.add_edge(0, 5, weight=2)
        graph.add_edge(1, 2, weight=3)
        graph.add_edge(2, 3, weight=4)
        graph.add_edge(3, 4, weight=5)
        graph.add_edge(3, 5, weight=6)
        graph.add_edge(4, 0, weight=7)
        graph.add_edge(5, 4, weight=8)
        graph.add_edge(5, 2, weight=9)
        return graph

    def test_graph(self):
        graph = self.create_graph()

        graph.add_edge(0, 1, weight=5)
        graph.add_edge(0, 5, weight=2)
        graph.add_edge(1, 2, weight=3)
        graph.add_edge(2, 3, weight=4)
        graph.add_edge(3, 4, weight=5)
        graph.add_edge(3, 5, weight=6)
        graph.add_edge(4, 0, weight=7)
        graph.add_edge(5, 4, weight=8)
        graph.add_edge(5, 2, weight=9)
        return graph

    def test_graph(self):
        graph = self.create_graph()

        graph.add_edge(0, 1, weight=5)
        graph.add_edge(0, 5, weight=2)
        graph.add_edge(1, 2, weight=3)
        graph.add_edge(2, 3, weight=4)
        graph.add_edge(3, 4, weight=5)
        graph.add_edge(3, 5, weight=6)
        graph.add_edge(4, 0, weight=7)
        graph.add_edge(5, 4, weight=8)
        graph.add_edge(5, 2, weight=9)
        return graph

    def test_graph(self):
        graph = self.create_graph()

        graph.add_edge(0, 1, weight=5)
        graph.add_edge(0, 5, weight=2)
        graph.add_edge(1, 2, weight=3)
        graph.add_edge(2, 3, weight=4)
        graph.add_edge(3, 4, weight=5)
        graph.add_edge(3, 5, weight=6)
        graph.add_edge(4, 0, weight=7)
        graph.add_edge(5, 4, weight=8)
        graph.add_edge(5, 2, weight=9)
        return graph

    def test_graph(self):
        graph = self.create_graph()

        graph.add_edge(0, 1, weight=5)
        graph.add_edge(0, 5, weight=2)
        graph.add_edge(1, 2, weight=3)
        graph.add_edge(2, 3, weight=4)
        graph.add_edge(3, 4, weight=5)
        graph.add_edge(3, 5, weight=6)
        graph.add_edge(4, 0, weight=7)
        graph.add_edge(5, 4, weight=8)
        graph.add_edge(5, 2, weight=9)
        return graph

    def test_graph(self):
        graph = self.create_graph()

        graph.add_edge(0, 1, weight=5)
        graph.add_edge(0, 5, weight=2)
        graph.add_edge(1, 2, weight=3)
        graph.add_edge(2, 3, weight=4)
        graph.add_edge(3, 4, weight=5)
        graph.add_edge(3, 5, weight=6)
        graph.add_edge(4, 0, weight=7)
        graph.add_edge(5, 4, weight=8)
        graph.add_edge(5, 2, weight=9)
        return graph

    def test_graph(self):
        graph = self.create_graph()

        graph.add_edge(0, 1, weight=5)
        graph.add_edge(0, 5, weight=2)
        graph.add_edge(1, 2, weight=3)
        graph.add_edge(2, 3, weight=4)
        graph.add_edge(3, 4, weight=5)
        graph.add_edge(3, 5, weight=6)
        graph.add_edge(4, 0, weight=7)
        graph.add_edge(5, 4, weight=8)
        graph.add_edge(5, 2, weight=9)
        return graph

    def test_graph(self):
        graph = self.create_graph()

        graph.add_edge(0, 1, weight=5)
        graph.add_edge(0, 5, weight=2)
        graph.add_edge(1, 2, weight=3)
        graph.add_edge(2, 3, weight=4)
        graph.add_edge(3, 4, weight=5)
        graph.add_edge(3, 5, weight=6)
        graph.add_edge(4, 0, weight=7)
        graph.add_edge(5, 4, weight=8)
        graph.add_edge(5, 2, weight=9)
        return graph

    def test_graph(self):
        graph = self.create_graph()

        graph.add_edge(0, 1, weight=5)
        graph.add_edge(0, 5, weight=2)
        graph.add_edge(1, 2, weight=3)
        graph.add_edge(2, 3, weight=4)
        graph.add_edge(3, 4, weight=5)
        graph.add_edge(3, 5, weight=6)
        graph.add_edge(4, 0, weight=7)
        graph.add_edge(5, 4, weight=8)
        graph.add_edge(5, 2, weight=9)
  
          assert_equal(graph.nodes[0].adjacent[graph.nodes[1]], 5)
          assert_equal(graph.nodes[0].adjacent[graph.nodes[5]], 2)
          assert_equal(graph.nodes[1].adjacent[graph.nodes[2]], 3)
          assert_equal(graph.nodes[2].adjacent[graph.nodes[3]], 4)
keep keep keep keep replace replace replace replace replace replace replace replace replace keep keep keep keep keep
 Rework graph challenge and solution (#86) 
graphs_trees/graph/test_graph.py