Unverified Commit 3c8382f6 authored by 鄢振宇Michael Yan's avatar 鄢振宇Michael Yan Committed by GitHub
Browse files

Fix typos in `zero-in-degree` (#2750)

parent 63d94f61
...@@ -54,8 +54,8 @@ class AGNNConv(nn.Block): ...@@ -54,8 +54,8 @@ class AGNNConv(nn.Block):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Example Example
......
...@@ -58,8 +58,8 @@ class EdgeConv(nn.Block): ...@@ -58,8 +58,8 @@ class EdgeConv(nn.Block):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Examples Examples
......
...@@ -74,8 +74,8 @@ class GATConv(nn.Block): ...@@ -74,8 +74,8 @@ class GATConv(nn.Block):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Examples Examples
......
...@@ -67,8 +67,8 @@ class GMMConv(nn.Block): ...@@ -67,8 +67,8 @@ class GMMConv(nn.Block):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Examples Examples
......
...@@ -70,8 +70,8 @@ class GraphConv(gluon.Block): ...@@ -70,8 +70,8 @@ class GraphConv(gluon.Block):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Examples Examples
......
...@@ -62,8 +62,8 @@ class SGConv(nn.Block): ...@@ -62,8 +62,8 @@ class SGConv(nn.Block):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Example Example
......
...@@ -54,8 +54,8 @@ class AGNNConv(nn.Module): ...@@ -54,8 +54,8 @@ class AGNNConv(nn.Module):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Example Example
......
...@@ -62,8 +62,8 @@ class DotGatConv(nn.Module): ...@@ -62,8 +62,8 @@ class DotGatConv(nn.Module):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Examples Examples
......
...@@ -57,8 +57,8 @@ class EdgeConv(nn.Module): ...@@ -57,8 +57,8 @@ class EdgeConv(nn.Module):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Examples Examples
......
...@@ -73,8 +73,8 @@ class GATConv(nn.Module): ...@@ -73,8 +73,8 @@ class GATConv(nn.Module):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Examples Examples
......
...@@ -66,8 +66,8 @@ class GMMConv(nn.Module): ...@@ -66,8 +66,8 @@ class GMMConv(nn.Module):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Examples Examples
......
...@@ -211,8 +211,8 @@ class GraphConv(nn.Module): ...@@ -211,8 +211,8 @@ class GraphConv(nn.Module):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Examples Examples
......
...@@ -59,8 +59,8 @@ class SGConv(nn.Module): ...@@ -59,8 +59,8 @@ class SGConv(nn.Module):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Example Example
......
...@@ -75,8 +75,8 @@ class GATConv(layers.Layer): ...@@ -75,8 +75,8 @@ class GATConv(layers.Layer):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Examples Examples
......
...@@ -72,8 +72,8 @@ class GraphConv(layers.Layer): ...@@ -72,8 +72,8 @@ class GraphConv(layers.Layer):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Examples Examples
......
...@@ -61,8 +61,8 @@ class SGConv(layers.Layer): ...@@ -61,8 +61,8 @@ class SGConv(layers.Layer):
Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph Calling ``add_self_loop`` will not work for some graphs, for example, heterogeneous graph
since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree`` since the edge type can not be decided for self_loop edges. Set ``allow_zero_in_degree``
to ``True`` for those cases to unblock the code and handle zere-in-degree nodes manually. to ``True`` for those cases to unblock the code and handle zero-in-degree nodes manually.
A common practise to handle this is to filter out the nodes with zere-in-degree when use A common practise to handle this is to filter out the nodes with zero-in-degree when use
after conv. after conv.
Example Example
......
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