Utility to convert adjacency matrix into adjacency list in python, for efficient BFS and DFS maybe

adjacencyMat_to_List.py

# get adjancy matrix

n= int(input()) #number of vertices
am=[]
for i in range(n):
  am.append([int(x) for x in input().split()])
print(am) #show matrix
print()

#conver to adjancy list

al= {} #doesnt contain path from a node to itself.
for x, row in enumerate(am):
  al[x+1]=[]
  for i, v in enumerate(row):
    if v== 1 and i!=x:
      al[x+1].append(i+1)
print(al)
    

Works well!