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)
| 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. |
no outgoing calls