Problem 1

The problem contains in computing the maximum time to finish all input tasks. To do this, we will output the biggest time required for any task.

In the function readData, I read the input information from the file schedule2.in. In the array finalResults, I will save all the final times, after the execution of the algorithms, therefore the output will be the max value of this array.

In the array tasksTime, I save the time required for the current task (read from the input file).

In the array taskDependencies, I save all the dependencies of any task i, if the respective task has any dependency. For exmaple, for task1 in the example read file, I will save task2 and task3 (his dependencies).

In unresolved, I will save the indexes for all the tasks that have to be resolved.

Initially, the resolved tasks are the ones with 0 dependencies. After that, the algorithm iterates in the unresolved array and I compute all the tasks that have all their dependencies already resolved.

The algorithm ends when all the initial unresolved tasks are now resolved (therefore all their dependencies have been resolved).

For resolving a particular task, I know all his dependencies are already resolved, so I know the time required to finish it (including the depending time).
The time for the current task is the maximum time between the time read from file and the time required to finish all the dependencies (because all tasks are finished 'in parallel' if possible).