clothes = {

}

graph = [[1, 4], [2, 4], [3], [], [], [4], [2, 7], [3], []]

visited = [0 for x in range(len(graph))]

stack = []

def print_stack(stack, clothes):

order += 1

def depth_first_search(u, visited, graph):

stack.append(u)

def topological_sort(graph, visited):

for v in range(len(graph)):

if not visited[v]:

depth_first_search(v, visited, graph)

if __name__ == "__main__":

topological_sort(graph, visited)

print(stack)

print_stack(stack, clothes)