"git@developer.sourcefind.cn:OpenDAS/bitsandbytes.git" did not exist on "469d5a631d77d135f055d3aa012ac852a0ef0856"
Unverified Commit 85c2ff71 authored by Tudor Andrei Dumitrascu's avatar Tudor Andrei Dumitrascu Committed by GitHub
Browse files

[Doc] Update link to correct destination. (#3966)



* Update link to correct destination.

* Update 4_rgcn.py

* Update 4_rgcn.py

* Update tutorials/models/1_gnn/4_rgcn.py

* Update tutorials/models/1_gnn/4_rgcn.py

* Update tutorials/models/1_gnn/4_rgcn.py
Co-authored-by: default avatarRhett Ying <85214957+Rhett-Ying@users.noreply.github.com>
parent ea44da50
...@@ -60,7 +60,7 @@ multiple edges among any given pair. ...@@ -60,7 +60,7 @@ multiple edges among any given pair.
# #
# This tutorial focuses on the first task, entity classification, to show how to generate entity # This tutorial focuses on the first task, entity classification, to show how to generate entity
# representation. `Complete # representation. `Complete
# code <https://github.com/dmlc/dgl/tree/rgcn/examples/pytorch/rgcn>`_ # code <https://github.com/dmlc/dgl/tree/master/examples/pytorch/rgcn>`_
# for both tasks is found in the DGL Github repository. # for both tasks is found in the DGL Github repository.
# #
# Key ideas of R-GCN # Key ideas of R-GCN
...@@ -361,5 +361,5 @@ for epoch in range(n_epochs): ...@@ -361,5 +361,5 @@ for epoch in range(n_epochs):
# #
# The implementation is similar to that presented here, but with an extra DistMult layer # The implementation is similar to that presented here, but with an extra DistMult layer
# stacked on top of the R-GCN layers. You can find the complete # stacked on top of the R-GCN layers. You can find the complete
# implementation of link prediction with R-GCN in our `Github Python code example # implementation of link prediction with R-GCN in our `Github Python code
# <https://github.com/dmlc/dgl/blob/master/examples/pytorch/rgcn/link_predict.py>`_. # example <https://github.com/dmlc/dgl/blob/master/examples/pytorch/rgcn/link.py>`_.
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment