dgraph ~master (2017-03-24T22:31:29Z)

IndexedEdgeList.neighbours

dgraphgraphIndexedEdgeList

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.

  1. auto neighboursIn(in size_t v)
  2. auto neighboursOut(in size_t v)
  3. auto neighbours(in size_t v)
    class IndexedEdgeList(bool dir)
    auto
    neighbours
    const
    (
    in size_t v
    )

Meta

Source

See Implementation

dgraphgraphIndexedEdgeList aliasesfunctions
Page generated by adrdox