Click here to Skip to main content
15,867,834 members
Please Sign up or sign in to vote.
0.00/5 (No votes)
See more:
ABC decides to constitute a communication team. A communication team consists of employees such that for every employee who is not in the team, there is a person in the communication team that is familiar with her work. Further the management decides that if the team consists of a particular employee, then her manager cannot be present in the communication team and for every employee who is not in the team, there is exactly one person in the communication team that is familiar with her work. Give an algorithm that selects such a com- munication team of the smallest possible size. or return such a team cannot exist.

What I have tried:

I have tried it using graph theory, but I am not sure about the correctness of the solution.
Posted
Comments
Member 15627495 21-Mar-23 14:04pm    
you have to conceive class employee , class manager with their dedicated job as data
so, before going trough Graph use, remenber the 'Set Theory'.
A include B ; B include C , B exclude A not C ....and so and so

once you have the good database , It's a well think SQL query to validate the 'best efficient team' with several 'models' of human teams.
[no name] 21-Mar-23 15:05pm    
I think it's "set theory".
Member 15627495 23-Mar-23 3:46am    
yes it's 'set' ! I update my comment

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900