neighbours: Finds all direct neighbours

In gRapHD: Efficient Selection of Undirected Graphical Models for High-Dimensional Datasets

Description

Finds all direct neighbours of a given vertex in a given graph.

Usage

neighbours(model=NULL,edges=NULL,v)

Arguments

model	gRapHD object.
edges	matrix with 2 columns, each row representing one edge, and each column one of the vertices in the edge.
v	reference vertex.

Details

Returns all vertices with a direct connection with vertex v in edges.

Value

Vector with all neighbours of vertex v.

Author(s)

Gabriel Coelho Goncalves de Abreu ([e-mail])

Examples

data(dsCont)
m1 <- minForest(dsCont,homog=TRUE,forbEdges=NULL,stat="LR")
neigh <- neighbours(edges=m1@edges, v=22)
#    > neigh
#    [1]  3  9 24 25

gRapHD documentation built on Feb. 9, 2018, 6:05 a.m.