communityNeighbours: communityNeighbours(community)
In DynComm: Dynamic Network Communities Detection and Generation

Description Usage Arguments Details Value Author(s) See Also Examples

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

1	DynComm.communityNeighbours(dyncomm,community)

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

The return value is a matrix with two columns. The first is the neighbour and the second is the weight of the edge that connects them.

a matrix of all communities in the graph that are neighbours of the given community and their edge weight

poltergeist0

DynComm , postProcess

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$communities()
dc$communityNeighbours(12)