Question

**Using your adjacency_matrix from the previous assignment, write build_graph which takes the same input**

** as adjacency_matrix, and returns the associated graph. Using SageMath**

Previous function is:

def adjacency_matrix(n, edges):

mat=[]

for i in range(n):

ls=[]

for j in range(n):

ls.append(0)

mat.append(ls)

for edge in edges:

i,j=edge[0],edge[1]

mat[i][j]=1

return mat

edges = [(0, 1), (0, 2), (0, 3), (2, 3)]

adjacency_matrix(4, edges)

Got this from tutor bsnl13 from here

**New function that needs to be made build_graph(n,edges) using sage **

### Recently Asked Questions

- Describe how cloud computing can provide assurance in the event of a disaster.Why should organizations consider moving to the cloud?What percentage of an

- What two powerful advantages are achieved in separating the file system functions and I/O functions into different tasks?

- Which Internet protocol is commonly used to transfer files from one system to another?