dgraph ~master (2021-12-31T14:43:43.2562653)

IndexedEdgeList.neighbours

dgraph graph IndexedEdgeList

Returns the IDs of vertices connected to v via incoming or outgoing links. If the graph is undirected the two will be identical and the general neighbours method is also defined.

class IndexedEdgeList(bool dir)
const
static if(!(directed))
auto
neighbours
(
in size_t v
)

Meta

Source

See Implementation

dgraph graph IndexedEdgeList aliasesfunctions

Page generated by adrdox