`get.neighborhood`

returns the IDs of all vertices belonging to the in, out, or combined neighborhoods of `v`

within network `x`

.

1 2 | ```
get.neighborhood(x, v, type = c("out", "in", "combined"),
na.omit=TRUE)
``` |

`x` |
an object of class |

`v` |
a vertex ID |

`type` |
the neighborhood to be computed |

`na.omit` |
logical; should missing edges be ignored when obtaining vertex neighborhoods? |

Note that the combined neighborhood is the union of the in and out neighborhoods – as such, no vertex will appear twice.

A vector containing the vertex IDs for the chosen neighborhood.

Carter T. Butts buttsc@uci.edu

Butts, C. T. (2008). “network: a Package for Managing Relational Data in R.” *Journal of Statistical Software*, 24(2). http://www.jstatsoft.org/v24/i02/

Wasserman, S. and Faust, K. 1994. *Social Network Analysis: Methods and Applications.* Cambridge: Cambridge University Press.

`get.edges`

, `is.adjacent`

1 2 3 4 5 6 7 8 9 | ```
#Create a network with three edges
m<-matrix(0,3,3)
m[1,2]<-1; m[2,3]<-1; m[3,1]<-1
g<-network(m)
#Examine the neighborhood of vertex 1
get.neighborhood(g,1,"out")
get.neighborhood(g,1,"in")
get.neighborhood(g,1,"combined")
``` |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.