# grg.game

From igraph v0.6.5-2
by Gabor Csardi

##### Geometric random graphs

Generate a random graph based on the distance of random point on a unit square

- Keywords
- graphs

##### Usage

`grg.game(nodes, radius, torus = FALSE, coords = FALSE)`

##### Arguments

- nodes
- The number of vertices in the graph.
- radius
- The radius within which the vertices will be connected by an edge.
- torus
- Logical constant, whether to use a torus instead of a square.
- coords
- Logical scalar, whether to add the positions of the
vertices as vertex attributes called
and`x`

.`y`

##### Details

First a number of points are dropped on a unit square, these points
correspond to the vertices of the graph to create. Two points will be
connected with an undirected edge if they are closer to each other in
Euclidean norm than a given radius. If the `torus`

argument is
`TRUE`

then a unit area torus is used instead of a square.

##### Value

- A graph object. If
`coords`

is`TRUE`

then with vertex attributes and`x`

.`y`

##### concept

Geometric random graph

##### See Also

##### Examples

```
g <- grg.game(1000, 0.05, torus=FALSE)
g2 <- grg.game(1000, 0.05, torus=TRUE)
```

*Documentation reproduced from package igraph, version 0.6.5-2, License: GPL (>= 2)*

### Community examples

Looks like there are no examples yet.