DynComm: neighbours – R documentation

Become an expert in R — Interactive courses, Cheat Sheets, certificates and more!

neighbours

neighbours(vertex)

Description

Get all neighbours (vertices connected through direct edges) of the given vertex in the graph from the selected post processing algorithm or the main algorithm, after the last iteration.

Usage

DynComm.neighbours(dyncomm,vertex)

Arguments

`dyncomm`	A DynComm object, if not using the inline version of the function call
`vertex`	The vertex to get neighbours from

Value

a matrix of all vertices in the graph that are neighbours of the given vertex and their edge weight

Author(s)

poltergeist0

Examples

library(DynComm)

Parameters<-matrix(c("e","0.1","w", "FALSE"),ncol=2, byrow=TRUE)
dc<-DynComm(ALGORITHM$LOUVAIN,CRITERION$MODULARITY,Parameters)
dc$addRemoveEdges(
 matrix(
   c(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,12,13,1,1,1,2,2,2,18,12,19,20,2,3,11,12,4,9,5,9,22)
      ,ncol=2)
)

dc$neighbours(2)

DynComm

Dynamic Network Communities Detection and Generation

v2020.1.6

GPL-2

Authors

Rui P. Sarmento [aut, cre] (<https://orcid.org/0000-0003-1891-5295>), Luís Lemos [aut], Mário Cordeiro [ctb], Giulio Rossetti [ctb]

Initial release