File: each_edge.Rd

package info (click to toggle)
r-cran-igraph 1.0.1-1%2Bdeb9u1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 18,232 kB
  • sloc: ansic: 173,538; cpp: 19,365; fortran: 4,550; yacc: 1,164; tcl: 931; lex: 484; makefile: 149; sh: 9
file content (41 lines) | stat: -rw-r--r-- 1,177 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
% Generated by roxygen2 (4.1.1): do not edit by hand
% Please edit documentation in R/rewire.R
\name{each_edge}
\alias{each_edge}
\title{Rewires the endpoints of the edges of a graph to a random vertex}
\usage{
each_edge(prob, loops = FALSE, multiple = FALSE)
}
\arguments{
\item{prob}{The rewiring probability, a real number between zero and one.}

\item{loops}{Logical scalar, whether loop edges are allowed in the rewired
graph.}

\item{multiple}{Logical scalar, whether multiple edges are allowed int the
  generated graph.}
}
\description{
This function can be used together with \code{\link{rewire}}.
This method rewires the endpoints of the edges with a constant probability
uniformly randomly to a new vertex in a graph.
}
\details{
Note that this method might create graphs with multiple and/or loop edges.
}
\examples{
# Some random shortcuts shorten the distances on a lattice
g <- make_lattice(length = 100, dim = 1, nei = 5)
mean_distance(g)
g <- rewire(g, each_edge(prob = 0.05))
mean_distance(g)
}
\author{
Gabor Csardi \email{csardi.gabor@gmail.com}
}
\seealso{
Other rewiring functions: \code{\link{keeping_degseq}};
  \code{\link{rewire}}
}
\keyword{graphs}