MCPcopy Index your code
hub / github.com/dmlc/dgl / add_edge

Function add_edge

python/dgl/data/knowledge_graph.py:294–316  ·  view source on GitHub ↗
(s, r, d, reverse, edge_set)

Source from the content-addressed store, hash-verified

292 d_type = "node"
293
294 def add_edge(s, r, d, reverse, edge_set):
295 r_type = str(r)
296 e_type = (s_type, r_type, d_type)
297 if raw_subg.get(e_type, None) is None:
298 raw_subg[e_type] = ([], [])
299 raw_subg_eset[e_type] = []
300 raw_subg_etype[e_type] = []
301 raw_subg[e_type][0].append(s)
302 raw_subg[e_type][1].append(d)
303 raw_subg_eset[e_type].append(edge_set)
304 raw_subg_etype[e_type].append(r)
305
306 if reverse is True:
307 r_type = str(r + num_rels)
308 re_type = (d_type, r_type, s_type)
309 if raw_reverse_sugb.get(re_type, None) is None:
310 raw_reverse_sugb[re_type] = ([], [])
311 raw_reverse_subg_etype[re_type] = []
312 raw_reverse_subg_eset[re_type] = []
313 raw_reverse_sugb[re_type][0].append(d)
314 raw_reverse_sugb[re_type][1].append(s)
315 raw_reverse_subg_eset[re_type].append(edge_set)
316 raw_reverse_subg_etype[re_type].append(r + num_rels)
317
318 for edge in train:
319 s, r, d = edge

Callers 1

build_knowledge_graphFunction · 0.85

Calls 2

appendMethod · 0.80
getMethod · 0.45

Tested by

no test coverage detected