Question

Python

Function Name: networks
Parameters: int, list of tuples of int Returns: list of sets of int

Description: In your class, many students are friends. Let’s assume that two students sharing a friend must be friends themselves; in other words, if students 0 and 1 are friends and students 1 and 2 are friends, then students 0 and 2 must be friends. Using this rule, we can partition the students into circles of friends.

To do this, implement a function networks() that takes two input arguments. The first is the number n of students in the class. We assume students are identified using integers 0 through n 1. The second input argument is a list of tuple objects that define friends. For example, tuple (0,2) defines students 0 and 2 as friends. Function networks() should print the partition of students into circles of friends as illustrated below:

Sample Inputs/Outputs:

Example Call: networks(5, [(0, 1), (1, 2), (3, 4)])
 Expected Return: [{0, 1, 2}, {3, 4}] 

Answer 1

Answer

Code

def networks(n, list_of_tuples):
"""
(int, list of tuples of int) -> list of sets of int
prints the partition of students into circles of friends
"""
#create an empty list
circles = []
#add each student to the list circles
for stu in range(n):
circles.append({stu})
#for each tuple in the list_of_tuples
for pair in list_of_tuples:
#merge the corresponding student sets in the list circles
merge = circles[pair[0]] | circles[pair[1]]
#for each student in merge
for i in merge:
#replace the old set with merged set
circles[i] = merge
#remove the duplicate sets
circle_list = []
[circle_list.append(x) for x in circles if x not in circle_list]
#return the list of sets
return circle_list
  

Note - The above code might not be indented. Please take special care to indent your code while writing it in your editor. Refer to the below screenshots and indent your code accordingly.

Code screenshot

Sample output