Question: Python Programming assignment using GRAPHS: A group of people form small groups where there is one host for each meeting. The host always rotates to

Python Programming assignment using GRAPHS:

A group of people form small groups where there is one host for each meeting. The host always rotates to a next person so that every member can visit each home and rotate being a host. Example: a group of 12 would have 3 hosts with each host meeting with 3 people in the group, at the hosts home.

  • Your goal is to design and develop a program that will read a list of people and the desired size of small groups (EX: 12 people's names, small group size 4). There is one additional issue to consider: married couples always go together as one.

  • Given a list of n people with a size of small groups m, what is the minimum number of iterations necessary to accomplish the goal of everybody visiting everybody's house? What is the time complexity of such an algorithm?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!