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>
226 行
7.4 KiB
Python
226 行
7.4 KiB
Python
import dgl
|
|
import numpy as np
|
|
import backend as F
|
|
import networkx as nx
|
|
import unittest
|
|
import pytest
|
|
from test_utils.graph_cases import get_cases
|
|
from utils import parametrize_dtype
|
|
|
|
@parametrize_dtype
|
|
def test_sum_case1(idtype):
|
|
# NOTE: If you want to update this test case, remember to update the docstring
|
|
# example too!!!
|
|
g1 = dgl.graph(([0, 1], [1, 0]), idtype=idtype, device=F.ctx())
|
|
g1.ndata['h'] = F.tensor([1., 2.])
|
|
g2 = dgl.graph(([0, 1], [1, 2]), idtype=idtype, device=F.ctx())
|
|
g2.ndata['h'] = F.tensor([1., 2., 3.])
|
|
bg = dgl.batch([g1, g2])
|
|
bg.ndata['w'] = F.tensor([.1, .2, .1, .5, .2])
|
|
assert F.allclose(F.tensor([3.]), dgl.sum_nodes(g1, 'h'))
|
|
assert F.allclose(F.tensor([3., 6.]), dgl.sum_nodes(bg, 'h'))
|
|
assert F.allclose(F.tensor([.5, 1.7]), dgl.sum_nodes(bg, 'h', 'w'))
|
|
|
|
@parametrize_dtype
|
|
@pytest.mark.parametrize('g', get_cases(['homo'], exclude=['dglgraph']))
|
|
@pytest.mark.parametrize('reducer', ['sum', 'max', 'mean'])
|
|
def test_reduce_readout(g, idtype, reducer):
|
|
g = g.astype(idtype).to(F.ctx())
|
|
g.ndata['h'] = F.randn((g.number_of_nodes(), 3))
|
|
g.edata['h'] = F.randn((g.number_of_edges(), 2))
|
|
|
|
# Test.1: node readout
|
|
x = dgl.readout_nodes(g, 'h', op=reducer)
|
|
# check correctness
|
|
subg = dgl.unbatch(g)
|
|
subx = []
|
|
for sg in subg:
|
|
sx = dgl.readout_nodes(sg, 'h', op=reducer)
|
|
subx.append(sx)
|
|
assert F.allclose(x, F.cat(subx, dim=0))
|
|
|
|
x = getattr(dgl, '{}_nodes'.format(reducer))(g, 'h')
|
|
# check correctness
|
|
subg = dgl.unbatch(g)
|
|
subx = []
|
|
for sg in subg:
|
|
sx = getattr(dgl, '{}_nodes'.format(reducer))(sg, 'h')
|
|
subx.append(sx)
|
|
assert F.allclose(x, F.cat(subx, dim=0))
|
|
|
|
# Test.2: edge readout
|
|
x = dgl.readout_edges(g, 'h', op=reducer)
|
|
# check correctness
|
|
subg = dgl.unbatch(g)
|
|
subx = []
|
|
for sg in subg:
|
|
sx = dgl.readout_edges(sg, 'h', op=reducer)
|
|
subx.append(sx)
|
|
assert F.allclose(x, F.cat(subx, dim=0))
|
|
|
|
x = getattr(dgl, '{}_edges'.format(reducer))(g, 'h')
|
|
# check correctness
|
|
subg = dgl.unbatch(g)
|
|
subx = []
|
|
for sg in subg:
|
|
sx = getattr(dgl, '{}_edges'.format(reducer))(sg, 'h')
|
|
subx.append(sx)
|
|
assert F.allclose(x, F.cat(subx, dim=0))
|
|
|
|
@parametrize_dtype
|
|
@pytest.mark.parametrize('g', get_cases(['homo'], exclude=['dglgraph']))
|
|
@pytest.mark.parametrize('reducer', ['sum', 'max', 'mean'])
|
|
def test_weighted_reduce_readout(g, idtype, reducer):
|
|
g = g.astype(idtype).to(F.ctx())
|
|
g.ndata['h'] = F.randn((g.number_of_nodes(), 3))
|
|
g.ndata['w'] = F.randn((g.number_of_nodes(), 1))
|
|
g.edata['h'] = F.randn((g.number_of_edges(), 2))
|
|
g.edata['w'] = F.randn((g.number_of_edges(), 1))
|
|
|
|
# Test.1: node readout
|
|
x = dgl.readout_nodes(g, 'h', 'w', op=reducer)
|
|
# check correctness
|
|
subg = dgl.unbatch(g)
|
|
subx = []
|
|
for sg in subg:
|
|
sx = dgl.readout_nodes(sg, 'h', 'w', op=reducer)
|
|
subx.append(sx)
|
|
assert F.allclose(x, F.cat(subx, dim=0))
|
|
|
|
x = getattr(dgl, '{}_nodes'.format(reducer))(g, 'h', 'w')
|
|
# check correctness
|
|
subg = dgl.unbatch(g)
|
|
subx = []
|
|
for sg in subg:
|
|
sx = getattr(dgl, '{}_nodes'.format(reducer))(sg, 'h', 'w')
|
|
subx.append(sx)
|
|
assert F.allclose(x, F.cat(subx, dim=0))
|
|
|
|
# Test.2: edge readout
|
|
x = dgl.readout_edges(g, 'h', 'w', op=reducer)
|
|
# check correctness
|
|
subg = dgl.unbatch(g)
|
|
subx = []
|
|
for sg in subg:
|
|
sx = dgl.readout_edges(sg, 'h', 'w', op=reducer)
|
|
subx.append(sx)
|
|
assert F.allclose(x, F.cat(subx, dim=0))
|
|
|
|
x = getattr(dgl, '{}_edges'.format(reducer))(g, 'h', 'w')
|
|
# check correctness
|
|
subg = dgl.unbatch(g)
|
|
subx = []
|
|
for sg in subg:
|
|
sx = getattr(dgl, '{}_edges'.format(reducer))(sg, 'h', 'w')
|
|
subx.append(sx)
|
|
assert F.allclose(x, F.cat(subx, dim=0))
|
|
|
|
@parametrize_dtype
|
|
@pytest.mark.parametrize('g', get_cases(['homo'], exclude=['dglgraph']))
|
|
@pytest.mark.parametrize('descending', [True, False])
|
|
def test_topk(g, idtype, descending):
|
|
g = g.astype(idtype).to(F.ctx())
|
|
g.ndata['x'] = F.randn((g.number_of_nodes(), 3))
|
|
|
|
# Test.1: to test the case where k > number of nodes.
|
|
dgl.topk_nodes(g, 'x', 100, sortby=-1)
|
|
|
|
# Test.2: test correctness
|
|
min_nnodes = F.asnumpy(g.batch_num_nodes()).min()
|
|
if min_nnodes <= 1:
|
|
return
|
|
k = min_nnodes - 1
|
|
val, indices = dgl.topk_nodes(g, 'x', k, descending=descending, sortby=-1)
|
|
print(k)
|
|
print(g.ndata['x'])
|
|
print('val', val)
|
|
print('indices', indices)
|
|
subg = dgl.unbatch(g)
|
|
subval, subidx = [], []
|
|
for sg in subg:
|
|
subx = F.asnumpy(sg.ndata['x'])
|
|
ai = np.argsort(subx[:,-1:].flatten())
|
|
if descending:
|
|
ai = np.ascontiguousarray(ai[::-1])
|
|
subx = np.expand_dims(subx[ai[:k]], 0)
|
|
subval.append(F.tensor(subx))
|
|
subidx.append(F.tensor(np.expand_dims(ai[:k], 0)))
|
|
print(F.cat(subval, dim=0))
|
|
assert F.allclose(val, F.cat(subval, dim=0))
|
|
assert F.allclose(indices, F.cat(subidx, dim=0))
|
|
|
|
# Test.3: sorby=None
|
|
dgl.topk_nodes(g, 'x', k, sortby=None)
|
|
|
|
g.edata['x'] = F.randn((g.number_of_edges(), 3))
|
|
|
|
# Test.4: topk edges where k > number of edges.
|
|
dgl.topk_edges(g, 'x', 100, sortby=-1)
|
|
|
|
# Test.5: topk edges test correctness
|
|
min_nedges = F.asnumpy(g.batch_num_edges()).min()
|
|
if min_nedges <= 1:
|
|
return
|
|
k = min_nedges - 1
|
|
val, indices = dgl.topk_edges(g, 'x', k, descending=descending, sortby=-1)
|
|
print(k)
|
|
print(g.edata['x'])
|
|
print('val', val)
|
|
print('indices', indices)
|
|
subg = dgl.unbatch(g)
|
|
subval, subidx = [], []
|
|
for sg in subg:
|
|
subx = F.asnumpy(sg.edata['x'])
|
|
ai = np.argsort(subx[:,-1:].flatten())
|
|
if descending:
|
|
ai = np.ascontiguousarray(ai[::-1])
|
|
subx = np.expand_dims(subx[ai[:k]], 0)
|
|
subval.append(F.tensor(subx))
|
|
subidx.append(F.tensor(np.expand_dims(ai[:k], 0)))
|
|
print(F.cat(subval, dim=0))
|
|
assert F.allclose(val, F.cat(subval, dim=0))
|
|
assert F.allclose(indices, F.cat(subidx, dim=0))
|
|
|
|
@parametrize_dtype
|
|
@pytest.mark.parametrize('g', get_cases(['homo'], exclude=['dglgraph']))
|
|
def test_softmax(g, idtype):
|
|
g = g.astype(idtype).to(F.ctx())
|
|
g.ndata['h'] = F.randn((g.number_of_nodes(), 3))
|
|
g.edata['h'] = F.randn((g.number_of_edges(), 2))
|
|
|
|
# Test.1: node readout
|
|
x = dgl.softmax_nodes(g, 'h')
|
|
subg = dgl.unbatch(g)
|
|
subx = []
|
|
for sg in subg:
|
|
subx.append(F.softmax(sg.ndata['h'], dim=0))
|
|
assert F.allclose(x, F.cat(subx, dim=0))
|
|
|
|
# Test.2: edge readout
|
|
x = dgl.softmax_edges(g, 'h')
|
|
subg = dgl.unbatch(g)
|
|
subx = []
|
|
for sg in subg:
|
|
subx.append(F.softmax(sg.edata['h'], dim=0))
|
|
assert F.allclose(x, F.cat(subx, dim=0))
|
|
|
|
@parametrize_dtype
|
|
@pytest.mark.parametrize('g', get_cases(['homo'], exclude=['dglgraph']))
|
|
def test_broadcast(idtype, g):
|
|
g = g.astype(idtype).to(F.ctx())
|
|
gfeat = F.randn((g.batch_size, 3))
|
|
|
|
# Test.0: broadcast_nodes
|
|
g.ndata['h'] = dgl.broadcast_nodes(g, gfeat)
|
|
subg = dgl.unbatch(g)
|
|
for i, sg in enumerate(subg):
|
|
assert F.allclose(sg.ndata['h'],
|
|
F.repeat(F.reshape(gfeat[i], (1,3)), sg.number_of_nodes(), dim=0))
|
|
|
|
# Test.1: broadcast_edges
|
|
g.edata['h'] = dgl.broadcast_edges(g, gfeat)
|
|
subg = dgl.unbatch(g)
|
|
for i, sg in enumerate(subg):
|
|
assert F.allclose(sg.edata['h'],
|
|
F.repeat(F.reshape(gfeat[i], (1,3)), sg.number_of_edges(), dim=0))
|