Pequenas melhorias relacionadas a PEP8

Author: kelvins

src/python/arvore_binaria_de_busca.py

@@ -12,7 +12,7 @@ def __init__(self, chave):
         self.direita = None
 
 
-############# Metodos de Busca #############
+# Metodos de Busca
 def busca_recursiva(no, chave):
     if no is None:
         print(f'{chave} nao foi encontrado na arvore')
@@ -37,10 +37,7 @@ def busca_linear(no, chave):
     return None
 
 
-############################################
-
-
-############ Metodo de Insercao ############
+# Metodo de Insercao
 def insere(no, chave):
     if no is None:
         no = Arvore(chave)
@@ -52,9 +49,7 @@ def insere(no, chave):
     return no
 
 
-############################################
-
-########### Metodos de Impressao ###########
+# Metodos de Impressao
 IMPRIME_ARVORE = ''
 
 
@@ -85,10 +80,7 @@ def pos_ordem(no):
     IMPRIME_ARVORE += str(no.chave) + ', '
 
 
-############################################
-
-
-######### Acha a Altura da Arvore ##########
+# Acha a Altura da Arvore
 def maximo(a, b):
     if a > b:
         return a
@@ -101,10 +93,7 @@ def altura(no):
     return 1 + maximo(altura(no.esquerda), altura(no.direita))
 
 
-############################################
-
-
-########### Metodos de Exclusao ############
+# Metodos de Exclusao
 def busca_no_pai(no, ch):
     no_pai = no
     while no is not None:
@@ -153,9 +142,6 @@ def exclui(no, ch):
     return True
 
 
-############################################
-
-
 if __name__ == '__main__':
     arvore = Arvore(3)  # Cria arvore (raiz)
     # Insere varios valores na arvore

src/python/binary_tree.py

@@ -3,7 +3,7 @@
 
 class Node:
     """
-    Node class store the data and the pointers to the next nodes (left and right).
+    Node class store the data and the pointers to the next nodes (left/right).
     """
 
     def __init__(self, data):
@@ -13,7 +13,7 @@ def __init__(self, data):
 
 class BinaryTree:
     """
-    Binary tree class provides some methods to insert, remove and print the data.
+    Binary tree class provides some methods to insert, remove and print data.
     """
 
     def __init__(self):

src/python/passeio_do_cavalo.py

@@ -26,13 +26,13 @@ def tenta_mover(i, x, y):
     """
     done = i > numSqr  # True ou False
     k = 0
-    while done == False and k < 8:
+    while not done and k < 8:
         u = x + dx[k]  # Coordenadas dos 8 movimentos possiveis do cavalo
         v = y + dy[k]  # Coordenadas dos 8 movimentos possiveis do cavalo
         if aceitavel(u, v):
             tabuleiro[u][v] = i
             done = tenta_mover(i + 1, u, v)  # Tenta outro movimento
-            if done == False:
+            if not done:
                 tabuleiro[u][v] = 0  # Sem sucesso, descarta movimento
         k += 1  # Passa ao proximo movimento possivel
     return done
@@ -42,7 +42,7 @@ def mostra_movimento(x, y):
     tabuleiro[x][y] = 1
     done = tenta_mover(2, x, y)
     string = ""
-    if done == True:
+    if done:
         for x in range(0, num):
             for y in range(0, num):
                 if tabuleiro[x][y] < 10:

src/python/selection_sort.py

@@ -14,7 +14,8 @@ def selection_sort(vetor, indice):
     if indice >= len(vetor) - 1:
         return -1
 
-    min_indice = indice  # minIndice vai guardar posicao onde esta o menor valor em relacao ao indice
+    # minIndice guarda a posicao onde esta o menor valor em relacao ao indice
+    min_indice = indice
 
     for i in range(indice + 1, len(vetor)):
         if vetor[i] < vetor[min_indice]: