# nndist.lpp

##### Nearest neighbour distances on a linear network

Given a pattern of points on a linear network, compute the nearest-neighbour distances, measured by the shortest path in the network.

- Keywords
- spatial

##### Usage

```
# S3 method for lpp
nndist(X, ..., k=1, method="C")
```

##### Arguments

- X
Point pattern on linear network (object of class

`"lpp"`

).- method
Optional string determining the method of calculation. Either

`"interpreted"`

or`"C"`

.- k
Integer, or integer vector. The algorithm will compute the distance to the

`k`

th nearest neighbour.- …
Ignored.

##### Details

Given a pattern of points on a linear network, this function computes the nearest neighbour distance for each point (i.e. the distance from each point to the nearest other point), measuring distance by the shortest path in the network.

If `method="C"`

the distances are computed using
code in the C language. If `method="interpreted"`

then the
computation is performed using interpreted R code. The R code is
much slower, but is provided for checking purposes.

The `k`

th nearest neighbour distance is infinite
if the `k`

th nearest neighbour does not exist. This can occur
if there are fewer than `k+1`

points in the dataset, or if
the linear network is not connected.

##### Value

A numeric vector, of length equal to the number of points in `X`

,
or a matrix, with one row for each point in `X`

and one column
for each entry of `k`

. Entries are nonnegative numbers or
infinity (`Inf`

).

##### See Also

##### Examples

```
# NOT RUN {
X <- runiflpp(12, simplenet)
nndist(X)
nndist(X, k=2)
# }
```

*Documentation reproduced from package spatstat, version 1.59-0, License: GPL (>= 2)*