dmlc--dgl
44089c8b4d
* Merge * [Graph][CUDA] Graph on GPU and many refactoring (#1791) * change edge_ids behavior and C++ impl * fix unittests; remove utils.Index in edge_id * pass mx and th tests * pass tf test * add aten::Scatter_ * Add nonzero; impl CSRGetDataAndIndices/CSRSliceMatrix * CSRGetData and CSRGetDataAndIndices passed tests * CSRSliceMatrix basic tests * fix bug in empty slice * CUDA CSRHasDuplicate * has_node; has_edge_between * predecessors, successors * deprecate send/recv; fix send_and_recv * deprecate send/recv; fix send_and_recv * in_edges; out_edges; all_edges; apply_edges * in deg/out deg * subgraph/edge_subgraph * adj * in_subgraph/out_subgraph * sample neighbors * set/get_n/e_repr * wip: working on refactoring all idtypes * pass ndata/edata tests on gpu * fix * stash * workaround nonzero issue * stash * nx conversion * test_hetero_basics except update routines * test_update_routines * test_hetero_basics for pytorch * more fixes * WIP: flatten graph * wip: flatten * test_flatten * test_to_device * fix bug in to_homo * fix bug in CSRSliceMatrix * pass subgraph test * fix send_and_recv * fix filter * test_heterograph * passed all pytorch tests * fix mx unittest * fix pytorch test_nn * fix all unittests for PyTorch * passed all mxnet tests * lint * fix tf nn test * pass all tf tests * lint * lint * change deprecation * try fix compile * lint * update METIDS * fix utest * fix * fix utests * try debug * revert * small fix * fix utests * upd * upd * upd * fix * upd * upd * upd * upd * upd * trigger * +1s * [kernel] Use heterograph index instead of unitgraph index (#1813) * upd * upd * upd * fix * upd * upd * upd * upd * upd * trigger * +1s * [Graph] Mutation for Heterograph (#1818) * mutation add_nodes and add_edges * Add support for remove_edges, remove_nodes, add_selfloop, remove_selfloop * Fix Co-authored-by: Ubuntu <ubuntu@ip-172-31-51-214.ec2.internal> * upd * upd * upd * fix * [Transfom] Mutable transform (#1833) * add nodesy * All three * Fix * lint * Add some test case * Fix * Fix * Fix * Fix * Fix * Fix * fix * triger * Fix * fix Co-authored-by: Ubuntu <ubuntu@ip-172-31-51-214.ec2.internal> * [Graph] Migrate Batch & Readout module to heterograph (#1836) * dgl.batch * unbatch * fix to device * reduce readout; segment reduce * change batch_num_nodes|edges to function * reduce readout/ softmax * broadcast * topk * fix * fix tf and mx * fix some ci * fix batch but unbatch differently * new checkk * upd * upd * upd * idtype behavior; code reorg * idtype behavior; code reorg * wip: test_basics * pass test_basics * WIP: from nx/ to nx * missing files * upd * pass test_basics:test_nx_conversion * Fix test * Fix inplace update * WIP: fixing tests * upd * pass test_transform cpu * pass gpu test_transform * pass test_batched_graph * GPU graph auto cast to int32 * missing file * stash * WIP: rgcn-hetero * Fix two datasety * upd * weird * Fix capsuley * fuck you * fuck matthias * Fix dgmg * fix bug in block degrees; pass rgcn-hetero * rgcn * gat and diffpool fix also fix ppi and tu dataset * Tree LSTM * pointcloud * rrn; wip: sgc * resolve conflicts * upd * sgc and reddit dataset * upd * Fix deepwalk, gindt and gcn * fix datasets and sign * optimization * optimization * upd * upd * Fix GIN * fix bug in add_nodes add_edges; tagcn * adaptive sampling and gcmc * upd * upd * fix geometric * fix * metapath2vec * fix agnn * fix pickling problem of block * fix utests * miss file * linegraph * upd * upd * upd * graphsage * stgcn_wave * fix hgt * on unittests * Fix transformer * Fix HAN * passed pytorch unittests * lint * fix * Fix cluster gcn * cluster-gcn is ready * on fixing block related codes * 2nd order derivative * Revert "2nd order derivative" This reverts commit 523bf6c249bee61b51b1ad1babf42aad4167f206. * passed torch utests again * fix all mxnet unittests * delete some useless tests * pass all tf cpu tests * disable * disable distributed unittest * fix * fix * lint * fix * fix * fix script * fix tutorial * fix apply edges bug * fix 2 basics * fix tutorial Co-authored-by: yzh119 <expye@outlook.com> Co-authored-by: xiang song(charlie.song) <classicxsong@gmail.com> Co-authored-by: Ubuntu <ubuntu@ip-172-31-51-214.ec2.internal> Co-authored-by: Ubuntu <ubuntu@ip-172-31-7-42.us-west-2.compute.internal> Co-authored-by: Ubuntu <ubuntu@ip-172-31-1-5.us-west-2.compute.internal> Co-authored-by: Ubuntu <ubuntu@ip-172-31-68-185.ec2.internal>
177 行
5.9 KiB
Python
177 行
5.9 KiB
Python
"""Module for message propagation."""
|
|
from __future__ import absolute_import
|
|
|
|
from . import backend as F
|
|
from . import traversal as trv
|
|
from .heterograph import DGLHeteroGraph
|
|
|
|
__all__ = ['prop_nodes', 'prop_nodes_bfs', 'prop_nodes_topo',
|
|
'prop_edges', 'prop_edges_dfs']
|
|
|
|
def prop_nodes(graph,
|
|
nodes_generator,
|
|
message_func='default',
|
|
reduce_func='default',
|
|
apply_node_func='default'):
|
|
"""Functional method for :func:`dgl.DGLGraph.prop_nodes`.
|
|
|
|
Parameters
|
|
----------
|
|
node_generators : generator
|
|
The generator of node frontiers.
|
|
message_func : callable, optional
|
|
The message function.
|
|
reduce_func : callable, optional
|
|
The reduce function.
|
|
apply_node_func : callable, optional
|
|
The update function.
|
|
|
|
See Also
|
|
--------
|
|
dgl.DGLGraph.prop_nodes
|
|
"""
|
|
graph.prop_nodes(nodes_generator, message_func, reduce_func, apply_node_func)
|
|
|
|
def prop_edges(graph,
|
|
edges_generator,
|
|
message_func='default',
|
|
reduce_func='default',
|
|
apply_node_func='default'):
|
|
"""Functional method for :func:`dgl.DGLGraph.prop_edges`.
|
|
|
|
Parameters
|
|
----------
|
|
edges_generator : generator
|
|
The generator of edge frontiers.
|
|
message_func : callable, optional
|
|
The message function.
|
|
reduce_func : callable, optional
|
|
The reduce function.
|
|
apply_node_func : callable, optional
|
|
The update function.
|
|
|
|
See Also
|
|
--------
|
|
dgl.DGLGraph.prop_edges
|
|
"""
|
|
graph.prop_edges(edges_generator, message_func, reduce_func, apply_node_func)
|
|
|
|
def prop_nodes_bfs(graph,
|
|
source,
|
|
message_func,
|
|
reduce_func,
|
|
reverse=False,
|
|
apply_node_func=None):
|
|
"""Message propagation using node frontiers generated by BFS.
|
|
|
|
Parameters
|
|
----------
|
|
graph : DGLHeteroGraph
|
|
The graph object.
|
|
source : list, tensor of nodes
|
|
Source nodes.
|
|
message_func : callable
|
|
The message function.
|
|
reduce_func : callable
|
|
The reduce function.
|
|
reverse : bool, optional
|
|
If true, traverse following the in-edge direction.
|
|
apply_node_func : callable, optional
|
|
The update function.
|
|
|
|
See Also
|
|
--------
|
|
dgl.traversal.bfs_nodes_generator
|
|
"""
|
|
assert isinstance(graph, DGLHeteroGraph), \
|
|
'DGLGraph is deprecated, Please use DGLHeteroGraph'
|
|
assert len(graph.canonical_etypes) == 1, \
|
|
'prop_nodes_bfs only support homogeneous graph'
|
|
# TODO(murphy): Graph traversal currently is only supported on
|
|
# CPP graphs. Move graph to CPU as a workaround,
|
|
# which should be fixed in the future.
|
|
nodes_gen = trv.bfs_nodes_generator(graph.cpu(), source, reverse)
|
|
nodes_gen = [F.copy_to(frontier, graph.device) for frontier in nodes_gen]
|
|
prop_nodes(graph, nodes_gen, message_func, reduce_func, apply_node_func)
|
|
|
|
def prop_nodes_topo(graph,
|
|
message_func,
|
|
reduce_func,
|
|
reverse=False,
|
|
apply_node_func=None):
|
|
"""Message propagation using node frontiers generated by topological order.
|
|
|
|
Parameters
|
|
----------
|
|
graph : DGLHeteroGraph
|
|
The graph object.
|
|
message_func : callable
|
|
The message function.
|
|
reduce_func : callable
|
|
The reduce function.
|
|
reverse : bool, optional
|
|
If true, traverse following the in-edge direction.
|
|
apply_node_func : callable, optional
|
|
The update function.
|
|
|
|
See Also
|
|
--------
|
|
dgl.traversal.topological_nodes_generator
|
|
"""
|
|
assert isinstance(graph, DGLHeteroGraph), \
|
|
'DGLGraph is deprecated, Please use DGLHeteroGraph'
|
|
assert len(graph.canonical_etypes) == 1, \
|
|
'prop_nodes_topo only support homogeneous graph'
|
|
# TODO(murphy): Graph traversal currently is only supported on
|
|
# CPP graphs. Move graph to CPU as a workaround,
|
|
# which should be fixed in the future.
|
|
nodes_gen = trv.topological_nodes_generator(graph.cpu(), reverse)
|
|
nodes_gen = [F.copy_to(frontier, graph.device) for frontier in nodes_gen]
|
|
prop_nodes(graph, nodes_gen, message_func, reduce_func, apply_node_func)
|
|
|
|
def prop_edges_dfs(graph,
|
|
source,
|
|
message_func,
|
|
reduce_func,
|
|
reverse=False,
|
|
has_reverse_edge=False,
|
|
has_nontree_edge=False,
|
|
apply_node_func=None):
|
|
"""Message propagation using edge frontiers generated by labeled DFS.
|
|
|
|
Parameters
|
|
----------
|
|
graph : DGLHeteroGraph
|
|
The graph object.
|
|
source : list, tensor of nodes
|
|
Source nodes.
|
|
message_func : callable, optional
|
|
The message function.
|
|
reduce_func : callable, optional
|
|
The reduce function.
|
|
reverse : bool, optional
|
|
If true, traverse following the in-edge direction.
|
|
has_reverse_edge : bool, optional
|
|
If true, REVERSE edges are included.
|
|
has_nontree_edge : bool, optional
|
|
If true, NONTREE edges are included.
|
|
apply_node_func : callable, optional
|
|
The update function.
|
|
|
|
See Also
|
|
--------
|
|
dgl.traversal.dfs_labeled_edges_generator
|
|
"""
|
|
assert isinstance(graph, DGLHeteroGraph), \
|
|
'DGLGraph is deprecated, Please use DGLHeteroGraph'
|
|
assert len(graph.canonical_etypes) == 1, \
|
|
'prop_edges_dfs only support homogeneous graph'
|
|
# TODO(murphy): Graph traversal currently is only supported on
|
|
# CPP graphs. Move graph to CPU as a workaround,
|
|
# which should be fixed in the future.
|
|
edges_gen = trv.dfs_labeled_edges_generator(
|
|
graph.cpu(), source, reverse, has_reverse_edge, has_nontree_edge,
|
|
return_labels=False)
|
|
edges_gen = [F.copy_to(frontier, graph.device) for frontier in edges_gen]
|
|
prop_edges(graph, edges_gen, message_func, reduce_func, apply_node_func)
|