| rewire.edges {igraph} | R Documentation |
This function rewires the endpoints of the edges with a constant probability uniformly randomly to a new vertex in a graph.
rewire.edges(graph, prob, loops=FALSE, multiple=FALSE)
graph |
The input graph |
prob |
The rewiring probability, a real number between zero and one. |
loops |
Logical scalar, whether loop edges are allowed in the rewired graph. |
multiple |
Logical scalar, whether multiple edges are allowed int the generated graph. |
Note that this function might create graphs with multiple and/or loop edges.
A new graph object.
Gabor Csardi csardi.gabor@gmail.com
# Some random shortcuts shorten the distances on a lattice g <- graph.lattice( length=100, dim=1, nei=5 ) average.path.length(g) g <- rewire.edges( g, prob=0.05 ) average.path.length(g)