      "        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>
    "        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_solution.ipynb