52d4535b61cd82bc82a1ebb79d8dc66c5c50856e,python/dgl/graph_index.py,HeteroGraphIndex,predecessors,#HeteroGraphIndex#Any#Any#,1520
Before Change
utils.Index
Array of predecessors
return utils.toindex(_CAPI_DGLHeteroPredecessors(
self, int(etype), int(v)))
def successors(self, etype, v):
Return the successors of the node.
After Change
The edges.
preserve_nodes : bool
Indicates whether to preserve all nodes or not.
If true, keep the nodes which have no edge connected in the subgraph;
If false, all nodes without edge connected to it would be removed.
Returns
-------
In pattern: SUPERPATTERN
Frequency: 4
Non-data size: 5
Instances Project Name: dmlc/dgl
Commit Name: 52d4535b61cd82bc82a1ebb79d8dc66c5c50856e
Time: 2019-08-23
Author: coin2028@hotmail.com
File Name: python/dgl/graph_index.py
Class Name: HeteroGraphIndex
Method Name: predecessors
Project Name: dmlc/dgl
Commit Name: 52d4535b61cd82bc82a1ebb79d8dc66c5c50856e
Time: 2019-08-23
Author: coin2028@hotmail.com
File Name: python/dgl/graph_index.py
Class Name: HeteroGraphIndex
Method Name: successors
Project Name: dmlc/dgl
Commit Name: 52d4535b61cd82bc82a1ebb79d8dc66c5c50856e
Time: 2019-08-23
Author: coin2028@hotmail.com
File Name: python/dgl/graph_index.py
Class Name: HeteroGraphIndex
Method Name: has_nodes
Project Name: dmlc/dgl
Commit Name: 52d4535b61cd82bc82a1ebb79d8dc66c5c50856e
Time: 2019-08-23
Author: coin2028@hotmail.com
File Name: python/dgl/graph_index.py
Class Name: HeteroGraphIndex
Method Name: has_edges_between