Exemplos de depth_tree em Python

Exemplo n.º 1

 def test_insert_five(self):
     T = depth_tree([41, 38, 31, 12, 19])
     self.wrap(T, 38, 0)
     self.wrap(T, 19, 1)
     self.wrap(T, 41, 1)
     self.wrap(T, 12, 2)
     self.wrap(T, 31, 2)

Exemplo n.º 2

Arquivo: depth_tree_test.py Projeto: Firkraag/algorithm

 def test_insert_five(self):
     T = depth_tree([41, 38, 31, 12, 19])
     self.wrap(T, 38, 0)
     self.wrap(T, 19, 1)
     self.wrap(T, 41, 1)
     self.wrap(T, 12, 2)
     self.wrap(T, 31, 2)

Exemplo n.º 3

 def test_delete_five(self):
     T = depth_tree([41, 38, 31, 12, 19, 9])
     T.delete(T.iterative_tree_search(9))
     T.delete(T.iterative_tree_search(12))
     T.delete(T.iterative_tree_search(19))
     T.delete(T.iterative_tree_search(31))
     T.delete(T.iterative_tree_search(38))
     self.wrap(T, 41, 0)

Exemplo n.º 4

 def test_delete_two(self):
     T = depth_tree([41, 38, 31, 12, 19, 9])
     T.delete(T.iterative_tree_search(9))
     T.delete(T.iterative_tree_search(12))
     self.wrap(T, 38, 0)
     self.wrap(T, 19, 1)
     self.wrap(T, 41, 1)
     self.wrap(T, 31, 2)

Exemplo n.º 5

Arquivo: depth_tree_test.py Projeto: Firkraag/algorithm

 def test_delete_five(self):
     T = depth_tree([41, 38, 31, 12, 19, 9])
     T.delete(T.iterative_tree_search(9))
     T.delete(T.iterative_tree_search(12))
     T.delete(T.iterative_tree_search(19))
     T.delete(T.iterative_tree_search(31))
     T.delete(T.iterative_tree_search(38))
     self.wrap(T, 41, 0)

Exemplo n.º 6

Arquivo: depth_tree_test.py Projeto: Firkraag/algorithm

 def test_delete_two(self):
     T = depth_tree([41, 38, 31, 12, 19, 9])
     T.delete(T.iterative_tree_search(9))
     T.delete(T.iterative_tree_search(12))
     self.wrap(T, 38, 0)
     self.wrap(T, 19, 1)
     self.wrap(T, 41, 1)
     self.wrap(T, 31, 2)

Exemplo n.º 7

 def test_delete_six(self):
     T = depth_tree([41, 38, 31, 12, 19, 9])
     T.delete(T.iterative_tree_search(9))
     T.delete(T.iterative_tree_search(12))
     T.delete(T.iterative_tree_search(19))
     T.delete(T.iterative_tree_search(31))
     T.delete(T.iterative_tree_search(38))
     T.delete(T.iterative_tree_search(41))
     self.assertEquals(T.nil.depth, -1)

Exemplo n.º 8

Arquivo: depth_tree_test.py Projeto: Firkraag/algorithm

 def test_delete_six(self):
     T = depth_tree([41, 38, 31, 12, 19, 9])
     T.delete(T.iterative_tree_search(9))
     T.delete(T.iterative_tree_search(12))
     T.delete(T.iterative_tree_search(19))
     T.delete(T.iterative_tree_search(31))
     T.delete(T.iterative_tree_search(38))
     T.delete(T.iterative_tree_search(41))
     self.assertEquals(T.nil.depth, -1)

Exemplo n.º 9

 def test_insert_one(self):
     T = depth_tree([41])
     self.wrap(T, 41, 0)

Exemplo n.º 10

 def test_insert_four(self):
     T = depth_tree([41, 38, 31, 12])
     self.wrap(T, 38, 0)
     self.wrap(T, 31, 1)
     self.wrap(T, 41, 1)
     self.wrap(T, 12, 2)

Exemplo n.º 11

 def test_insert_three(self):
     T = depth_tree([41, 38, 31])
     self.wrap(T, 38, 0)
     self.wrap(T, 31, 1)
     self.wrap(T, 41, 1)

Exemplo n.º 12

 def test_insert_two(self):
     T = depth_tree([41, 38])
     self.wrap(T, 41, 0)
     self.wrap(T, 38, 1)

Exemplo n.º 13

Arquivo: depth_tree_test.py Projeto: Firkraag/algorithm

 def test_insert_two(self):
     T = depth_tree([41, 38])
     self.wrap(T, 41, 0)
     self.wrap(T, 38, 1)

Exemplo n.º 14

Arquivo: depth_tree_test.py Projeto: Firkraag/algorithm

 def test_insert_one(self):
     T = depth_tree([41])
     self.wrap(T, 41, 0)

Exemplo n.º 15

Arquivo: depth_tree_test.py Projeto: Firkraag/algorithm

 def test_insert_four(self):
     T = depth_tree([41, 38, 31, 12])
     self.wrap(T, 38, 0)
     self.wrap(T, 31, 1)
     self.wrap(T, 41, 1)
     self.wrap(T, 12, 2)

Exemplo n.º 16

Arquivo: depth_tree_test.py Projeto: Firkraag/algorithm

 def test_insert_three(self):
     T = depth_tree([41, 38, 31])
     self.wrap(T, 38, 0)
     self.wrap(T, 31, 1)
     self.wrap(T, 41, 1)