Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update tutorial_equivariant_graph_embedding.py #1271

Merged
merged 2 commits into from
Dec 9, 2024
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion demonstrations/tutorial_equivariant_graph_embedding.py
Original file line number Diff line number Diff line change
Expand Up @@ -24,7 +24,7 @@
#
# For example, the graph in the image above is represented by each of the two equivalent adjacency matrices.
# The top matrix can be transformed into the bottom matrix
# by swapping the first row with the third row, then swapping the third column with the third column, then the
# by swapping the first row with the third row, then swapping the third column with the first column, then the
# new first row with the second, and finally the first colum with the second.
#
# But the number of such permutations grows factorially with the number of nodes in the graph, which
Expand Down
Loading