Don't use an adjacency matrix for choose.edges. Way, way faster. #26
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This makes sim.rand.graph.clust significantly faster and much less memory hungry.
The adjacency matrix was only really used for pretty standard functions that igraph supplies anyway.
For large graphs, this makes it way faster. Comparison on a graph with 10000 vertices:
So about 100 times faster, and around 1000 times less memory allocation. Rejoice! :)