Make SubgraphSearch robust to vertex labels #35904
Merged
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
dcoudert
added a commit
to dcoudert/sage
that referenced
this pull request
Jul 12, 2023
|
It seems I did something wrong when trying to rebase on last beta. This PR should modify only file |
mkoeppe
force-pushed
the
graphs/improve_subgraph_search
branch
from
6c8f49f to
d12921a
Compare
|
Rebased |
|
Thank you. |
|
Documentation preview for this PR (built with commit d12921a; changes) is ready! 🎉 |
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.
Part of #35902.
📚 Description
We ensure that the method operates properly even when vertices and edges are of incomparable types.
On the way, we also avoid a call to
adjacency_matrix.📝 Checklist
⌛ Dependencies