can anyone here tell what is the time complexity of this code?

node is a list of nodes. suppose, node=[[1,2,3],[6,9,8],[4,5,11,14],[10,15]]

lst=[] for j in node:     sg=G.subgraph(j)     temp=list(nx.connected_components(sg)) #temp is a list of sets like: [{1,7,0},{6,5},{2,9}]     for i in range(len(temp)-1):         p=temp[i].pop()         q=temp[i+1].pop()         lst.append([p,q])