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

## 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 ‘

`x`

’ and ‘`y`

’.- ...
Passed to

`sample_grg()`

.

## 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.

## See also

Random graph models (games)
`erdos.renyi.game()`

,
`sample_()`

,
`sample_bipartite()`

,
`sample_correlated_gnp()`

,
`sample_correlated_gnp_pair()`

,
`sample_degseq()`

,
`sample_dot_product()`

,
`sample_fitness()`

,
`sample_fitness_pl()`

,
`sample_forestfire()`

,
`sample_gnm()`

,
`sample_gnp()`

,
`sample_growing()`

,
`sample_hierarchical_sbm()`

,
`sample_islands()`

,
`sample_k_regular()`

,
`sample_last_cit()`

,
`sample_pa()`

,
`sample_pa_age()`

,
`sample_pref()`

,
`sample_sbm()`

,
`sample_smallworld()`

,
`sample_traits_callaway()`

,
`sample_tree()`

## Author

Gabor Csardi csardi.gabor@gmail.com, first version was written by Keith Briggs (http://keithbriggs.info/).