# pairdist.lpp

From spatstat v1.37-0
by Adrian Baddeley

##### Pairwise shortest-path distances between points on a linear network

Given a pattern of points on a linear network, compute the matrix of distances between all pairs of points, measuring distance by the shortest path in the network.

- Keywords
- spatial

##### Usage

```
## S3 method for class 'lpp':
pairdist(X, ..., 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"`

. - ...
- Ignored.

##### Details

Given a pattern of points on a linear network, this function computes the
matrix of distances between all pairs of points, 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 Rcode. The Rcode is
much slower, but is provided for checking purposes.

##### Value

- A symmetric matrix.

##### See Also

##### Examples

```
example(lpp)
pairdist(X)
```

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

### Community examples

Looks like there are no examples yet.