Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Scalability for large graphs #190

Open
jeskreiswinkler-etsy opened this issue Dec 13, 2020 · 0 comments
Open

Scalability for large graphs #190

jeskreiswinkler-etsy opened this issue Dec 13, 2020 · 0 comments

Comments

@jeskreiswinkler-etsy
Copy link

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?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@jeskreiswinkler-etsy