Hello list,
Please consider the following graph
library(igraph)
g <- erdos.renyi.game(100, 2/100)
E(g)$weight <- sample(1:10, ecount(g), replace=TRUE)
I am interested in "completing" the graph by adding all missing edges (as a
result each pair of vertices will be connected by an edge) but making sure the
new edges are assign E(g)$weight = 0.
Is it possible?
PS: Question also posted here:
http://stackoverflow.com/questions/21619566/how-to-complete-a-graph-assigning-0-as-weight-attribute-of-new-edges
_______________________________________________
igraph-help mailing list
[email protected]
https://lists.nongnu.org/mailman/listinfo/igraph-help
