          assert_equal(graph.nodes[1].incoming_edges, 0)
          graph.nodes[3].remove_neighbor(graph.nodes[4])
          assert_equal(graph.nodes[4].incoming_edges, 1)
  
          assert_equal(graph.nodes[0] < graph.nodes[1], True)
  
          print('Success: test_graph')
  
      def test_graph_undirected(self):
          graph = self.create_graph()
 
</s> remove         assert_equal(graph.nodes[4].incoming_edges, 1)
 </s> add         self.assertEqual(graph.nodes[4].incoming_edges, 1) </s> remove         assert_equal(graph.nodes[1].incoming_edges, 0)
 </s> add         self.assertEqual(graph.nodes[1].incoming_edges, 0) </s> remove     "        assert_equal(graph.nodes[0] < graph.nodes[1], True)\n",
 </s> add     "        self.assertEqual(graph.nodes[0] < graph.nodes[1], True)\n", </s> remove     "        assert_equal(graph.nodes[0] < graph.nodes[1], True)\n",
 </s> add     "        self.assertEqual(graph.nodes[0] < graph.nodes[1], True)\n", </s> remove     "        assert_equal(graph.nodes[4].incoming_edges, 1)\n",
 </s> add     "        self.assertEqual(graph.nodes[4].incoming_edges, 1)\n",
        self.assertEqual(graph.nodes[0] < graph.nodes[1], True)
          assert_equal(graph.nodes[1].incoming_edges, 0)
          graph.nodes[3].remove_neighbor(graph.nodes[4])
          assert_equal(graph.nodes[4].incoming_edges, 1)
  
        self.assertEqual(graph.nodes[0] < graph.nodes[1], True)
  
          print('Success: test_graph')
  
      def test_graph_undirected(self):
          graph = self.create_graph()
keep keep keep keep replace keep keep keep keep keep
 #273: Remove nose dependency for graphs_trees/ (#277) 
graphs_trees/graph/test_graph.py