When applying the algorithm list of adjacent in the depth search - DFS with a set of vertices and their adjacent ones, the algorithm presents a result, if it changes the order of the adjacents of at least one vertex, the result is another one. That is, the vertices visited in the algorithm have their visitation order changed according to the order of the adjacent vertices of a given vertex.
I ask if the vertices visited should be the same, regardless of the input order of the adjacent vertices of a given vertex to generate the adjacency list?