R/two_mode.R

In Wences91/testnet: Test network

#' two_mode
#' 
#' @param edges edges data.frame
#' @param size node sizes
#' @param edge_size edge sizes
#' @param degree_mode which degree calculates (in, out, total)
#' @param label_size text size
#' @param min_degree minimum node degree by which to filter
#' @export
#' @importFrom igraph graph_from_data_frame degree cluster_louvain layout_nicely as.undirected V E "V<-" delete_vertices
#' 

two_mode <- function(edges, size=1, edge_size=1, label_size=1, degree_mode='all', min_degree=0){
  # create two-mode network
  g <- igraph::graph_from_data_frame(edges, directed=TRUE)
  
  igraph::V(g)$degree <- igraph::degree(g, mode = degree_mode)
  igraph::V(g)$nsize <- size * (igraph::V(g)$degree/sum(igraph::V(g)$degree))
  
  igraph::E(g)$edge_size <- edge_size
  
  g <- igraph::delete_vertices(g, which(igraph::V(g)$degree < min_degree))
  
  g <- giant_component(g)
  
  communities <- igraph::cluster_louvain(igraph::as.undirected(g))
  cat(length(unique(communities$membership)), 'communities | Modularity:', max(communities$modularity), '\n')
  
  igraph::V(g)$colors <- ifelse(substr(igraph::V(g)$name, 1, 2) == 'S-', '#add8e6', '#da86c5')
  
  l <- igraph::layout_nicely(g)
  
  plot(communities, g, layout=l,
       vertex.size=igraph::V(g)$nsize, col=igraph::V(g)$colors, vertex.label.cex=label_size,
       edge.width=igraph::E(g)$edge_size, edge.arrow.size=0, edge.arrow.width=0, edge.color='#00000020',
       rescale=FALSE, ylim=c(min(l[,2]), max(l[,2])), xlim = c(min(l[,1]), max(l[,1])))
}