⚡ improve efficient of function CalculateGraphDistance() #13
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.
In original function, a loop was used for counting the frequency of each element in the
Distance
. While use this function to C=CCCCCCCCCC(=O)[O-].[Na+], the times of loop can hit 100 millions.Here I use the class
Counter
fromcollections
instead of loop, which can significantly improve the efficient.