We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e7a4bf3 commit 43d16e5Copy full SHA for 43d16e5
README.md
@@ -103,7 +103,7 @@ model refines its prediction of the shortest path.
103
104
----------------
105
106
-#### [Run "sort demo" in browser](https://colab.research.google.com/github/deepmind/graph_nets/blob/master/graph_nets/demos/sort.ipynb)
+#### [Run "sort demo" in browser](https://colab.research.google.com/github/deepmind/graph_nets/blob/master/graph_nets/demos/sort.ipynb) [(Run TF2 version)](https://colab.research.google.com/github/deepmind/graph_nets/blob/master/graph_nets/demos_tf2/sort.ipynb)
107
108
The "sort demo" creates lists of random numbers, and trains a graph network to
109
sort the list. After a sequence of message-passing steps, the model makes an
0 commit comments