From b54b61fb73cafada8d55db35458053d555dd4cf7 Mon Sep 17 00:00:00 2001 From: Catalina Albornoz Date: Mon, 9 Dec 2024 15:03:44 -0500 Subject: [PATCH] Update tutorial_equivariant_graph_embedding.py (#1271) fix typo --- demonstrations/tutorial_equivariant_graph_embedding.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/demonstrations/tutorial_equivariant_graph_embedding.py b/demonstrations/tutorial_equivariant_graph_embedding.py index 8dc970b494..060ff6953e 100644 --- a/demonstrations/tutorial_equivariant_graph_embedding.py +++ b/demonstrations/tutorial_equivariant_graph_embedding.py @@ -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