Code: def edge_to_adjacency(edge_list): # Add Your code here! #…

Question Answered step-by-step Code: def edge_to_adjacency(edge_list): # Add Your code here! #… Image transcription textSuppose you are given a weighted directed graph provided as an edge list, where each element of the listcontains the string node label of the source node, followed by the string node label of the destination node,followed by the integer weight of the edge. Generate an adjacenty matrix representing the equival… Show more… Show moreCode: def edge_to_adjacency(edge_list):# Add Your code here!# —— DO NOT CHANGE BELOW HERE —— #import astdef main():   matrix = edge_to_adjacency(ast.literal_eval(input()))   print(‘n’.join([‘ ‘.join([str(cell) for cell in row]) for row in matrix]))if __name__ == “__main__”:   main()  Computer Science Engineering & Technology Python Programming CSCI 1310 Share QuestionEmailCopy link Comments (0)