Scalability for large graphs

[jeskreiswinkler-etsy]

I am interested in using this code for analyzing large graphs, but it seems like memory complexity is going to scale like a polynomial if this adjacency matrix code is used:

adj = nx.adjacency_matrix(nx.from_dict_of_lists(graph))

Is there an alternative?