# linearOP

From slopeOP v1.0.0
by Vincent Runge

##### linearOP

An optimal partitioning algorithm with a linear fit for each segment

##### Usage

`linearOP(x, data, penalty, cc = FALSE)`

##### Arguments

- x
a vector (see data)

- data
a vector defining the data points (x[i], data[i])

- penalty
the penalty for introducing a new segment

- cc
a boolean to impose a continuity constraint

*Documentation reproduced from package slopeOP, version 1.0.0, License: MIT + file LICENSE*

### Community examples

Looks like there are no examples yet.