20 node graph with 33 random edges and 3 nonrandom edges

From InterSciWiki

Jump to: navigation, search
  1. GNU cohesive.blocks() (c) Written by Peter McMahan 2007 posted in October. 
require(igraph)
require(digest)
require(RSQLite)		
library(igraph)
source("http://www.charting1968.net/CohesiveBlocks.R") 
g <- read.graph(file="http://intersci.ss.uci.edu/wiki/Vlado/random20nodes36edges.net", format="pajek")
gBlocks  <- cohesive.blocks(g,verbose=TRUE,cutsetHeuristic=TRUE)  ##gBlocks <- cohesive.blocks(g)
lapply(gBlocks$blocks,function(i){V(gBlocks)[i]$id})
plot.bgraph(gBlocks,layout=layout.spring,vertex.size=12)  #No: ,layout=layout.kamada.kawai
write.pajek.bgraph(gBlocks,file="gBlocks")
max.cohesion(gBlocks)
Retrieved from "http://intersci.ss.uci.edu/wiki/index.php/20_node_graph_with_33_random_edges_and_3_nonrandom_edges"