          graph.add_edge(2, 1)
          graph.add_edge(3, 2)
          graph.add_edge(3, 4)
  
          assert_equal(graph.shortest_path(nodes[0].key, nodes[2].key), [0, 1, 3, 2])
          assert_equal(graph.shortest_path(nodes[0].key, nodes[0].key), [0])
          assert_equal(graph.shortest_path(nodes[4].key, nodes[5].key), None)
  
          print('Success: test_shortest_path')
  
  
  def main():
 
</s> remove     "        assert_equal(graph.shortest_path(nodes[0].key, nodes[2].key), [0, 1, 3, 2])\n",
    "        assert_equal(graph.shortest_path(nodes[0].key, nodes[0].key), [0])\n",
    "        assert_equal(graph.shortest_path(nodes[4].key, nodes[5].key), None)\n",
 </s> add     "        self.assertEqual(graph.shortest_path(nodes[0].key, nodes[2].key), [0, 1, 3, 2])\n",
    "        self.assertEqual(graph.shortest_path(nodes[0].key, nodes[0].key), [0])\n",
    "        self.assertEqual(graph.shortest_path(nodes[4].key, nodes[5].key), None)\n", </s> remove     "        assert_equal(graph.shortest_path(nodes[0].key, nodes[2].key), [0, 1, 3, 2])\n",
    "        assert_equal(graph.shortest_path(nodes[0].key, nodes[0].key), [0])\n",
    "        assert_equal(graph.shortest_path(nodes[4].key, nodes[5].key), None)\n",
 </s> add     "        self.assertEqual(graph.shortest_path(nodes[0].key, nodes[2].key), [0, 1, 3, 2])\n",
    "        self.assertEqual(graph.shortest_path(nodes[0].key, nodes[0].key), [0])\n",
    "        self.assertEqual(graph.shortest_path(nodes[4].key, nodes[5].key), None)\n", </s> remove         assert_equal(str(self.results), "[0, 1, 4, 5, 3, 2]")
 </s> add         self.assertEqual(str(self.results), "[0, 1, 4, 5, 3, 2]") </s> remove         assert_equal(str(self.results), "[0, 1, 3, 2, 4, 5]")
 </s> add         self.assertEqual(str(self.results), "[0, 1, 3, 2, 4, 5]") </s> remove         assert_equal(height(root), 4)
 </s> add         self.assertEqual(height(root), 4)
        self.assertEqual(graph.shortest_path(nodes[0].key, nodes[2].key), [0, 1, 3, 2])
        self.assertEqual(graph.shortest_path(nodes[0].key, nodes[0].key), [0])
        self.assertEqual(graph.shortest_path(nodes[4].key, nodes[5].key), None)
          graph.add_edge(2, 1)
          graph.add_edge(3, 2)
          graph.add_edge(3, 4)
  
        self.assertEqual(graph.shortest_path(nodes[0].key, nodes[2].key), [0, 1, 3, 2])
        self.assertEqual(graph.shortest_path(nodes[0].key, nodes[0].key), [0])
        self.assertEqual(graph.shortest_path(nodes[4].key, nodes[5].key), None)
        self.assertEqual(graph.shortest_path(nodes[0].key, nodes[2].key), [0, 1, 3, 2])
        self.assertEqual(graph.shortest_path(nodes[0].key, nodes[0].key), [0])
        self.assertEqual(graph.shortest_path(nodes[4].key, nodes[5].key), None)
        self.assertEqual(graph.shortest_path(nodes[0].key, nodes[2].key), [0, 1, 3, 2])
        self.assertEqual(graph.shortest_path(nodes[0].key, nodes[0].key), [0])
        self.assertEqual(graph.shortest_path(nodes[4].key, nodes[5].key), None)
  
          print('Success: test_shortest_path')
  
  
  def main():
keep keep keep keep replace replace replace keep keep keep keep keep
 #273: Remove nose dependency for graphs_trees/ (#277) 
graphs_trees/graph_shortest_path_unweighted/test_shortest_path.py