Called internally within riverdistancelist. Detects all possible routes from one river network segment to another, in the event of braiding.
routelist(startseg, endseg, rivers, reps = 100)
startseg | Segment number of the start of the route |
---|---|
endseg | Segment number of the end of the route |
rivers | The river network object to use |
reps | Deprecated. Was used in a previous version using randomization. |
A list of vectors, each describing a route in segment numbers.
The previous version of this function returned many possible routes using randomization - this algorithm now computes all possible routes.
data(KilleyW) plot(x=KilleyW)routelist(startseg=1, endseg=16, rivers=KilleyW, reps=1000)#> [[1]] #> [1] 1 2 4 15 16 #> #> [[2]] #> [1] 1 3 4 15 16 #> #> [[3]] #> [1] 1 2 4 5 6 8 9 11 12 14 16 #> #> [[4]] #> [1] 1 3 4 5 6 8 9 11 12 14 16 #> #> [[5]] #> [1] 1 2 4 5 7 8 9 11 12 14 16 #> #> [[6]] #> [1] 1 2 4 5 6 8 10 11 12 14 16 #> #> [[7]] #> [1] 1 2 4 5 6 8 9 11 13 14 16 #> #> [[8]] #> [1] 1 3 4 5 7 8 9 11 12 14 16 #> #> [[9]] #> [1] 1 3 4 5 6 8 10 11 12 14 16 #> #> [[10]] #> [1] 1 3 4 5 6 8 9 11 13 14 16 #> #> [[11]] #> [1] 1 2 4 5 7 8 10 11 12 14 16 #> #> [[12]] #> [1] 1 2 4 5 7 8 9 11 13 14 16 #> #> [[13]] #> [1] 1 2 4 5 6 8 10 11 13 14 16 #> #> [[14]] #> [1] 1 3 4 5 7 8 10 11 12 14 16 #> #> [[15]] #> [1] 1 3 4 5 7 8 9 11 13 14 16 #> #> [[16]] #> [1] 1 3 4 5 6 8 10 11 13 14 16 #> #> [[17]] #> [1] 1 2 4 5 7 8 10 11 13 14 16 #> #> [[18]] #> [1] 1 3 4 5 7 8 10 11 13 14 16 #>