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 ee1034c commit be6e828Copy full SHA for be6e828
1 file changed
ogb/io/README.md
@@ -24,7 +24,7 @@ Create `graph_list`, storing your graph objects, and call `saver.save_graph_list
24
25
Graph objects are dictionaries containing the following keys.
26
### Homogeneous graph:
27
-- `edge_index` (necessary): `numpy.ndarray` of shape `(2, num_edges)`. Includes bidirectional edges explicitly if graphs are undirected.
+- `edge_index` (necessary): `numpy.ndarray` of shape `(2, num_edges)`. Please include bidirectional edges explicitly if graphs are undirected.
28
- `num_nodes` (necessary): `int`, denoting the number of nodes in the graph.
29
- `node_feat` (optional): `numpy.ndarray` of shape `(num_nodes, node_feat_dim)`.
30
- `edge_feat` (optional): `numpy.ndarray` of shape `(num_edges, edge_feat_dim)`.
0 commit comments