Changing loop of dfs.

Now visiting the first neighboor

Author: DantasB

src/python/busca_em_grafo.py

@@ -83,7 +83,7 @@ def dfs(self, start: int) -> list:
             if u not in visitados:
                 visitados.append(u)
 
-            for v in self.adj[u]:
+            for v in self.adj[u][::-1]:
                 if v not in visitados:
                     pilha.append(v)