help! the output is not coming on the way it should and i can't find the mistake in the code

brief explanation about the code:

To solve this problem, we can use a depth-first search (DFS) algorithm. The idea is to start from the first vertex (0 in this case) and explore as far as possible along each branch before backtracking.

Sample input:

0 1 0 0 0 0 0 1 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 1 0 0 1 0 0 1 0 1 1 0 0 0 0 0 0 1 0 1 0 0 0 0 0 1 1 1 0 1 0 0 0 0 0 0 0 1 0 0 1 1 1 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0

Sample output:

0 1 2 3 4 5 6 7 8

the code: from sys import stdin def dfs(adj_matrix, start_vertex): # Initialize a list to store the vertices in the order they are visited visited = [] # Create a stack to store the vertices to be visited stack = [start_vertex] # While the stack is not empty while stack: # Pop the top vertex from the stack vertex = stack.pop() # If the vertex has not been visited if vertex not in visited: # Mark it as visited and add it to the list visited.append(vertex) # Get the neighbors of the vertex neighbors = [i for i, val in enumerate(adj_matrix[vertex]) if val == 1] # Push the neighbors onto the stack stack.extend(neighbors) return visited adj_matrix = [] for line in stdin: if line == '': break adj_matrix.append(list(map(int,line.split()))) m = dfs(adj_matrix, 0) print(*m)