care of not re-launching the same build again. Note that the result of build-order contains a unique UUID, which is the identifier of the node in the graph, which could be useful to dissambiguate. With this walk(temp_folder): for filename in filenames: filepath = os.path.join(root, filename) unique_name = str(uuid.uuid4()) source = { "type": "file", "path": filepath, "dest-filename": unique_name } build_command = The result is a list of lists, containing tuples. Each tuple contains 2 elements, the first is a UUID of the node of the graph. It is unique and ensures a way to address exactly one node, even if there

care of not re-launching the same build again. Note that the result of build-order contains a unique UUID, which is the identifier of the node in the graph, which could be useful to dissambiguate. With this walk(temp_folder): for filename in filenames: filepath = os.path.join(root, filename) unique_name = str(uuid.uuid4()) source = { "type": "file", "path": filepath, "dest-filename": unique_name } build_command = The result is a list of lists, containing tuples. Each tuple contains 2 elements, the first is a UUID of the node of the graph. It is unique and ensures a way to address exactly one node, even if there

care of not re-launching the same build again. Note that the result of build-order contains a unique UUID, which is the identifier of the node in the graph, which could be useful to dissambiguate. With this walk(temp_folder): for filename in filenames: filepath = os.path.join(root, filename) unique_name = str(uuid.uuid4()) source = { "type": "file", "path": filepath, "dest-filename": unique_name } build_command = The result is a list of lists, containing tuples. Each tuple contains 2 elements, the first is a UUID of the node of the graph. It is unique and ensures a way to address exactly one node, even if there

care of not re-launching the same build again. Note that the result of build-order contains a unique UUID, which is the identifier of the node in the graph, which could be useful to dissambiguate. With this walk(temp_folder): for filename in filenames: filepath = os.path.join(root, filename) unique_name = str(uuid.uuid4()) source = { "type": "file", "path": filepath, "dest-filename": unique_name } build_command = The result is a list of lists, containing tuples. Each tuple contains 2 elements, the first is a UUID of the node of the graph. It is unique and ensures a way to address exactly one node, even if there

care of not re-launching the same build again. Note that the result of build-order contains a unique UUID, which is the identifier of the node in the graph, which could be useful to dissambiguate. With this walk(temp_folder): for filename in filenames: filepath = os.path.join(root, filename) unique_name = str(uuid.uuid4()) source = { "type": "file", "path": filepath, "dest-filename": unique_name } build_command = The result is a list of lists, containing tuples. Each tuple contains 2 elements, the first is a UUID of the node of the graph. It is unique and ensures a way to address exactly one node, even if there

care of not re-launching the same build again. Note that the result of build-order contains a unique UUID, which is the identifier of the node in the graph, which could be useful to dissambiguate. With this walk(temp_folder): for filename in filenames: filepath = os.path.join(root, filename) unique_name = str(uuid.uuid4()) source = { "type": "file", "path": filepath, "dest-filename": unique_name } build_command = The result is a list of lists, containing tuples. Each tuple contains 2 elements, the first is a UUID of the node of the graph. It is unique and ensures a way to address exactly one node, even if there

care of not re-launching the same build again. Note that the result of build-order contains a unique UUID, which is the identifier of the node in the graph, which could be useful to dissambiguate. With this walk(temp_folder): for filename in filenames: filepath = os.path.join(root, filename) unique_name = str(uuid.uuid4()) source = { "type": "file", "path": filepath, "dest-filename": unique_name } build_command = The result is a list of lists, containing tuples. Each tuple contains 2 elements, the first is a UUID of the node of the graph. It is unique and ensures a way to address exactly one node, even if there

care of not re-launching the same build again. Note that the result of build-order contains a unique UUID, which is the identifier of the node in the graph, which could be useful to dissambiguate. With this walk(temp_folder): for filename in filenames: filepath = os.path.join(root, filename) unique_name = str(uuid.uuid4()) source = { "type": "file", "path": filepath, "dest-filename": unique_name } build_command = The result is a list of lists, containing tuples. Each tuple contains 2 elements, the first is a UUID of the node of the graph. It is unique and ensures a way to address exactly one node, even if there

care of not re-launching the same build again. Note that the result of build-order contains a unique UUID, which is the identifier of the node in the graph, which could be useful to dissambiguate. With this walk(temp_folder): for filename in filenames: filepath = os.path.join(root, filename) unique_name = str(uuid.uuid4()) source = { "type": "file", "path": filepath, "dest-filename": unique_name } build_command = The result is a list of lists, containing tuples. Each tuple contains 2 elements, the first is a UUID of the node of the graph. It is unique and ensures a way to address exactly one node, even if there

care of not re-launching the same build again. Note that the result of build-order contains a unique UUID, which is the identifier of the node in the graph, which could be useful to dissambiguate. With this The result is a list of lists, containing tuples. Each tuple contains 2 elements, the first is a UUID of the node of the graph. It is unique and ensures a way to address exactly one node, even if there