dmlc--dgl
Da Zheng
929742b588
* init. * it's compiled. * add immutable graph constructor. * add immutable graph API. * fix. * impl get adjacency matrix. * fix. * fix graph_index from scipy matrix. * add neighbor sampling. * remap vertex ids. * fix. * move sampler test. * fix tests. * add comments * remove mxnet-specific immutable graph. * fix. * fix lint. * fix. * try to fix windows compile error. * fix. * fix. * add test. * unify Graph and ImmutableGraph. * fix bugs. * fix compile. * move immutable graph. * fix. * remove print. * fix lint. * fix * fix lint. * fix lint. * fix test. * fix comments. * merge GraphIndex and ImmutableGraphIndex. * temp fix. * impl GetAdj. * fix lint * fix. * fix. * fix. * fix. * fix. * use csr only for readonly graph. * Revert "use csr only for readonly graph." This reverts commit 8e24bb033af8504531b22849de5b7567b168e0d5. * remove code. * fix. * fix. * fix. * fix. * fix. * fix. * address comments. * fix for comments. * fix comments. * revert. * move test_graph_index to compute. * fix. * fix. * impl GetAdj for coo. * fix. * fix tests. * address comments. * address comments. * fix comment. * address comments. * use lambda. * other comments. * address comments. * modify the semantics of edges. * fix order. * use DGLIdIter * fix. * remove NotImplemented. * revert some code.
159 行
4.2 KiB
Python
159 行
4.2 KiB
Python
from dgl import DGLError
|
|
from dgl.utils import toindex
|
|
from dgl.graph_index import create_graph_index
|
|
import networkx as nx
|
|
|
|
def test_edge_id():
|
|
gi = create_graph_index(multigraph=False)
|
|
assert not gi.is_multigraph()
|
|
|
|
gi = create_graph_index(multigraph=True)
|
|
|
|
gi.add_nodes(4)
|
|
gi.add_edge(0, 1)
|
|
eid = gi.edge_id(0, 1).tonumpy()
|
|
assert len(eid) == 1
|
|
assert eid[0] == 0
|
|
assert gi.is_multigraph()
|
|
|
|
# multiedges
|
|
gi.add_edge(0, 1)
|
|
eid = gi.edge_id(0, 1).tonumpy()
|
|
assert len(eid) == 2
|
|
assert eid[0] == 0
|
|
assert eid[1] == 1
|
|
|
|
gi.add_edges(toindex([0, 1, 1, 2]), toindex([2, 2, 2, 3]))
|
|
src, dst, eid = gi.edge_ids(toindex([0, 0, 2, 1]), toindex([2, 1, 3, 2]))
|
|
eid_answer = [2, 0, 1, 5, 3, 4]
|
|
assert len(eid) == 6
|
|
assert all(e == ea for e, ea in zip(eid, eid_answer))
|
|
|
|
# find edges
|
|
src, dst, eid = gi.find_edges(toindex([1, 3, 5]))
|
|
assert len(src) == len(dst) == len(eid) == 3
|
|
assert src[0] == 0 and src[1] == 1 and src[2] == 2
|
|
assert dst[0] == 1 and dst[1] == 2 and dst[2] == 3
|
|
assert eid[0] == 1 and eid[1] == 3 and eid[2] == 5
|
|
|
|
# source broadcasting
|
|
src, dst, eid = gi.edge_ids(toindex([0]), toindex([1, 2]))
|
|
eid_answer = [0, 1, 2]
|
|
assert len(eid) == 3
|
|
assert all(e == ea for e, ea in zip(eid, eid_answer))
|
|
|
|
# destination broadcasting
|
|
src, dst, eid = gi.edge_ids(toindex([1, 0]), toindex([2]))
|
|
eid_answer = [3, 4, 2]
|
|
assert len(eid) == 3
|
|
assert all(e == ea for e, ea in zip(eid, eid_answer))
|
|
|
|
gi.clear()
|
|
# the following assumes that grabbing nonexistent edge will throw an error
|
|
try:
|
|
gi.edge_id(0, 1)
|
|
fail = True
|
|
except DGLError:
|
|
fail = False
|
|
finally:
|
|
assert not fail
|
|
|
|
gi.add_nodes(4)
|
|
gi.add_edge(0, 1)
|
|
eid = gi.edge_id(0, 1).tonumpy()
|
|
assert len(eid) == 1
|
|
assert eid[0] == 0
|
|
|
|
def test_nx():
|
|
gi = create_graph_index(multigraph=True)
|
|
|
|
gi.add_nodes(2)
|
|
gi.add_edge(0, 1)
|
|
nxg = gi.to_networkx()
|
|
assert len(nxg.nodes) == 2
|
|
assert len(nxg.edges(0, 1)) == 1
|
|
gi.add_edge(0, 1)
|
|
nxg = gi.to_networkx()
|
|
assert len(nxg.edges(0, 1)) == 2
|
|
|
|
nxg = nx.DiGraph()
|
|
nxg.add_edge(0, 1)
|
|
gi = create_graph_index(nxg)
|
|
assert not gi.is_multigraph()
|
|
assert gi.number_of_nodes() == 2
|
|
assert gi.number_of_edges() == 1
|
|
assert gi.edge_id(0, 1)[0] == 0
|
|
|
|
nxg = nx.MultiDiGraph()
|
|
nxg.add_edge(0, 1)
|
|
nxg.add_edge(0, 1)
|
|
gi = create_graph_index(nxg, True)
|
|
assert gi.is_multigraph()
|
|
assert gi.number_of_nodes() == 2
|
|
assert gi.number_of_edges() == 2
|
|
assert 0 in gi.edge_id(0, 1)
|
|
assert 1 in gi.edge_id(0, 1)
|
|
|
|
nxg = nx.DiGraph()
|
|
nxg.add_nodes_from(range(3))
|
|
gi = create_graph_index(nxg)
|
|
assert gi.number_of_nodes() == 3
|
|
assert gi.number_of_edges() == 0
|
|
|
|
gi = create_graph_index()
|
|
gi.add_nodes(3)
|
|
nxg = gi.to_networkx()
|
|
assert len(nxg.nodes) == 3
|
|
assert len(nxg.edges) == 0
|
|
|
|
nxg = nx.DiGraph()
|
|
nxg.add_edge(0, 1, id=0)
|
|
nxg.add_edge(1, 2, id=1)
|
|
gi = create_graph_index(nxg)
|
|
assert 0 in gi.edge_id(0, 1)
|
|
assert 1 in gi.edge_id(1, 2)
|
|
assert gi.number_of_edges() == 2
|
|
assert gi.number_of_nodes() == 3
|
|
|
|
def test_predsucc():
|
|
gi = create_graph_index(multigraph=True)
|
|
|
|
gi.add_nodes(4)
|
|
gi.add_edge(0, 1)
|
|
gi.add_edge(0, 1)
|
|
gi.add_edge(0, 2)
|
|
gi.add_edge(2, 0)
|
|
gi.add_edge(3, 0)
|
|
gi.add_edge(0, 0)
|
|
gi.add_edge(0, 0)
|
|
|
|
pred = gi.predecessors(0)
|
|
assert len(pred) == 3
|
|
assert 2 in pred
|
|
assert 3 in pred
|
|
assert 0 in pred
|
|
|
|
succ = gi.successors(0)
|
|
assert len(succ) == 3
|
|
assert 1 in succ
|
|
assert 2 in succ
|
|
assert 0 in succ
|
|
|
|
def test_create_from_elist():
|
|
elist = [(2, 1), (1, 0), (2, 0), (3, 0), (0, 2)]
|
|
g = create_graph_index(elist)
|
|
for i, (u, v) in enumerate(elist):
|
|
assert g.edge_id(u, v)[0] == i
|
|
# immutable graph
|
|
# TODO: disabled due to torch support
|
|
#g = create_graph_index(elist, readonly=True)
|
|
#for i, (u, v) in enumerate(elist):
|
|
# print(u, v, g.edge_id(u, v)[0])
|
|
# assert g.edge_id(u, v)[0] == i
|
|
|
|
if __name__ == '__main__':
|
|
test_edge_id()
|
|
test_nx()
|
|
test_predsucc()
|
|
test_create_from_elist()
|