      "        assert_equal(graph.nodes[5].adjacent[graph.nodes[0]], 2)\n",
      "        assert_equal(graph.nodes[1].adjacent[graph.nodes[2]], 3)\n",
      "        assert_equal(graph.nodes[2].adjacent[graph.nodes[1]], 3)\n",
      "\n",
      "        print('Success: test_graph')\n",
      "\n",
      "\n",
      "def main():\n",
      "    test = TestGraph()\n",
      "    test.test_graph()\n",
 
</s>
    "        print('Success: test_graph_undirected')\n",
      "        assert_equal(graph.nodes[5].adjacent[graph.nodes[0]], 2)\n",
      "        assert_equal(graph.nodes[1].adjacent[graph.nodes[2]], 3)\n",
      "        assert_equal(graph.nodes[2].adjacent[graph.nodes[1]], 3)\n",
      "\n",
    "        print('Success: test_graph_undirected')\n",
      "\n",
      "\n",
      "def main():\n",
      "    test = TestGraph()\n",
      "    test.test_graph()\n",
keep keep keep keep replace keep keep keep keep keep
 Rework graph challenge and solution (#90)
graphs_trees/graph/graph_solution.ipynb