Consider a group of n robots, and m tasks. Tasks can be different and robots are

Question

Consider a group of n robots, and m tasks. Tasks can be different and robots are specialized, hence a given robot can only perform certain tasks. For each robot, you are given a list of tasks in a text file that the robot is capable of performing. Assume each task takes one day to perform from start to finish, and once a robot starts working on a task, it completes it before starting on another task. Also, the robots cannot multi-task. Finally, assume that there are no dependencies among tasks and any subset of tasks can be worked on concurrently by qualified robots.

A text file is given with inputs like:
3, 10
1, 1, 3, 4
2, 2, 5, 8
3, 5, 7, 9
where the numbers on the first line correspond to # of robots(3) and total number of tasks(10) & the numbers on lines 2-4 correspond to robot number followed by what tasks the specified robot can complete. 

What graphing algorithm such as DFS or BFS could be used to figure out max number of tasks that can be completed in a day?

Explanation / Answer

Hi i have solved this question in my notebook, but i can't type it and post it here because there's no time... please rate me lifesaver and i'll make sure the answer is in your inbox! i don't do this generally but i am doing this due to lack of time...

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.