slight performance increase for graph.all_nodes() #458
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
set.update() seems to be faster than union and we can save the set creation overhead: ```python In [1]: %timeit s = set(range(1000)) ; s.update(range(10000)) 1000 loops, best of 3: 419 µs per loop In [2]: %timeit s = set(range(1000)) ; s.update(set(range(10000))) 1000 loops, best of 3: 584 µs per loop In [3]: %timeit s = set(range(1000)) ; s.union(set(range(10000))) 1000 loops, best of 3: 610 µs per loop ```
joernhees
added a commit
that referenced
this pull request
Feb 25, 2015
slight performance increase for graph.all_nodes()
This was referenced Jan 16, 2017
This was referenced Mar 16, 2017
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
set.update() seems to be faster than union and we can save the set
creation overhead: