MCPcopy
hub / github.com/dmlc/dgl / find_edge

Method find_edge

python/dgl/graph_index.py:359–375  ·  view source on GitHub ↗

Return the edge tuple of the given id. Parameters ---------- eid : int The edge id. Returns ------- int src node id int dst node id

(self, eid)

Source from the content-addressed store, hash-verified

357 return src, dst, eid
358
359 def find_edge(self, eid):
360 """Return the edge tuple of the given id.
361
362 Parameters
363 ----------
364 eid : int
365 The edge id.
366
367 Returns
368 -------
369 int
370 src node id
371 int
372 dst node id
373 """
374 ret = _CAPI_DGLGraphFindEdge(self, int(eid))
375 return ret(0), ret(1)
376
377 def find_edges(self, eid):
378 """Return a triplet of arrays that contains the edge IDs.

Callers 15

invoke_edge_udfFunction · 0.80
data_dict_to_listFunction · 0.80
get_typeid_by_targetFunction · 0.80
_gspmmFunction · 0.80
_gspmm_heteroFunction · 0.80
__setstate__Method · 0.80
bits_neededMethod · 0.80
adjacency_matrixMethod · 0.80
incidence_matrixMethod · 0.80
send_and_recvMethod · 0.80

Calls

no outgoing calls

Tested by 1

test_reverseFunction · 0.64