          graph.add_edge('h', 'f', weight=2)
          graph.add_edge('h', 'g', weight=2)
          shortest_path = ShortestPath(graph)
          result = shortest_path.find_shortest_path('a', 'i')
          assert_equal(result, ['a', 'c', 'd', 'g', 'i'])
          assert_equal(shortest_path.path_weight['i'], 8)
  
          print('Success: test_shortest_path')
  
  
  def main():
 
</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, ['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(graph.nodes[0].adj_weights[graph.nodes[1].key], 5)
        assert_equal(graph.nodes[1].adj_weights[graph.nodes[0].key], 5)
        assert_equal(graph.nodes[0].adj_weights[graph.nodes[5].key], 2)
        assert_equal(graph.nodes[5].adj_weights[graph.nodes[0].key], 2)
        assert_equal(graph.nodes[1].adj_weights[graph.nodes[2].key], 3)
        assert_equal(graph.nodes[2].adj_weights[graph.nodes[1].key], 3)
 </s> add         self.assertEqual(graph.nodes[0].adj_weights[graph.nodes[1].key], 5)
        self.assertEqual(graph.nodes[1].adj_weights[graph.nodes[0].key], 5)
        self.assertEqual(graph.nodes[0].adj_weights[graph.nodes[5].key], 2)
        self.assertEqual(graph.nodes[5].adj_weights[graph.nodes[0].key], 2)
        self.assertEqual(graph.nodes[1].adj_weights[graph.nodes[2].key], 3)
        self.assertEqual(graph.nodes[2].adj_weights[graph.nodes[1].key], 3)
        self.assertEqual(result, ['a', 'c', 'd', 'g', 'i'])
        self.assertEqual(shortest_path.path_weight['i'], 8)
          graph.add_edge('h', 'f', weight=2)
          graph.add_edge('h', 'g', weight=2)
          shortest_path = ShortestPath(graph)
          result = shortest_path.find_shortest_path('a', 'i')
        self.assertEqual(result, ['a', 'c', 'd', 'g', 'i'])
        self.assertEqual(shortest_path.path_weight['i'], 8)
        self.assertEqual(result, ['a', 'c', 'd', 'g', 'i'])
        self.assertEqual(shortest_path.path_weight['i'], 8)
  
          print('Success: test_shortest_path')
  
  
  def main():
keep keep keep keep replace replace keep keep keep keep keep
 #273: Remove nose dependency for graphs_trees/ (#277) 
graphs_trees/graph_shortest_path/test_shortest_path.py