Conversation
Bring down the complexity of from O(2^n) to O(n) in number of nodes. Signed-off-by: Harmen Stoppels <[email protected]>
haampie
force-pushed
the
hs/fix/diff-complexity
branch
from
1191f96 to
dfc2a3f
Compare
alalazo
approved these changes
Sep 8, 2025
alalazo
pushed a commit
that referenced
this pull request
Sep 8, 2025
Bring down the complexity of from O(2^n) to O(n) in number of nodes. Signed-off-by: Harmen Stoppels <[email protected]>
haampie
added a commit
that referenced
this pull request
Sep 12, 2025
Bring down the complexity of from O(2^n) to O(n) in number of nodes. Signed-off-by: Harmen Stoppels <[email protected]>
This file contains hidden or 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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
Closes #51253
Bring down the complexity of
spack difffrom O(2^n) to O(n) in number of nodes, which is typically desirable.