      "        graph.add_edge('h', 'f', weight=2)\n",
      "        graph.add_edge('h', 'g', weight=2)\n",
      "        shortest_path = ShortestPath(graph)\n",
      "        result = shortest_path.find_shortest_path('a', 'i')\n",
      "        assert_equal(result, ['a', 'c', 'd', 'g', 'i'])\n",
      "        assert_equal(shortest_path.path_weight['i'], 8)\n",
      "\n",
      "        print('Success: test_shortest_path')\n",
      "\n",
      "\n",
      "def main():\n",
 
</s> remove     "        assert_equal(result, ['a', 'c', 'd', 'g', 'i'])\n",
    "        assert_equal(shortest_path.path_weight['i'], 8)\n",
 </s> add     "        self.assertEqual(result, ['a', 'c', 'd', 'g', 'i'])\n",
    "        self.assertEqual(shortest_path.path_weight['i'], 8)\n", </s> remove         assert_equal(result, ['a', 'c', 'd', 'g', 'i'])
        assert_equal(shortest_path.path_weight['i'], 8)
 </s> add         self.assertEqual(result, ['a', 'c', 'd', 'g', 'i'])
        self.assertEqual(shortest_path.path_weight['i'], 8) </s> remove     "assert_equal(result, ['a', 'c', 'd', 'g', 'i'])\n",
    "assert_equal(shortest_path.path_weight['i'], 8)\n",
 </s> add     "self.assertEqual(result, ['a', 'c', 'd', 'g', 'i'])\n",
    "self.assertEqual(shortest_path.path_weight['i'], 8)\n", </s> remove     "assert_equal(result, ['a', 'c', 'd', 'g', 'i'])\n",
    "assert_equal(shortest_path.path_weight['i'], 8)\n",
 </s> add     "self.assertEqual(result, ['a', 'c', 'd', 'g', 'i'])\n",
    "self.assertEqual(shortest_path.path_weight['i'], 8)\n", </s> remove     "        assert_equal(result, root)\n",
    "        assert_equal(result.left, node7)\n",
    "        assert_equal(result.right, node2)\n",
    "        assert_equal(result.left.left, node9)\n",
    "        assert_equal(result.left.right, node6)\n",
    "        assert_equal(result.right.left, node3)\n",
    "        assert_equal(result.right.right, node1)\n",
 </s> add     "        self.assertEqual(result, root)\n",
    "        self.assertEqual(result.left, node7)\n",
    "        self.assertEqual(result.right, node2)\n",
    "        self.assertEqual(result.left.left, node9)\n",
    "        self.assertEqual(result.left.right, node6)\n",
    "        self.assertEqual(result.right.left, node3)\n",
    "        self.assertEqual(result.right.right, node1)\n",
    "        self.assertEqual(result, ['a', 'c', 'd', 'g', 'i'])\n",
    "        self.assertEqual(shortest_path.path_weight['i'], 8)\n",
      "        graph.add_edge('h', 'f', weight=2)\n",
      "        graph.add_edge('h', 'g', weight=2)\n",
      "        shortest_path = ShortestPath(graph)\n",
      "        result = shortest_path.find_shortest_path('a', 'i')\n",
    "        self.assertEqual(result, ['a', 'c', 'd', 'g', 'i'])\n",
    "        self.assertEqual(shortest_path.path_weight['i'], 8)\n",
    "        self.assertEqual(result, ['a', 'c', 'd', 'g', 'i'])\n",
    "        self.assertEqual(shortest_path.path_weight['i'], 8)\n",
      "\n",
      "        print('Success: test_shortest_path')\n",
      "\n",
      "\n",
      "def main():\n",
keep keep keep keep replace replace keep keep keep keep keep
 #273: Remove nose dependency for graphs_trees/ (#277) 
graphs_trees/graph_shortest_path/graph_shortest_path_challenge.ipynb