DynComm (version 2020.1.6)

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

See Also

DynComm , postProcess

Examples

# NOT RUN {
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)

# }