dgraph v0.0.2 (2015-10-27T21:47:00Z)

IndexedEdgeList.neighboursOut

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.

  1. auto neighboursOut(size_t v)
    class IndexedEdgeList(bool dir)
    const
    static if(directed)
    auto
    neighboursOut
    (
    in size_t v
    )
  2. alias neighboursOut = neighbours
  3. auto neighboursIn(size_t v)
  4. auto neighbours(size_t v)

Meta

Source

See Implementation

dgraph graph IndexedEdgeList aliasesfunctions

Page generated by adrdox