This operation converts linkage values into directional values.
direction_raw = Recode linkage
Assigning 128 to 1
Assigning 64 To 2
Assigning 32 To 3
Assigning 16To 4
Assigning 8 To 5
Assigning 4 To 6
Assigning 2 To 7
Assigning 1 To 8
Assigning 66To 9
Assigning 24 To 10
Assigning 36 To 11
Assigning 129 To 12
Assigning 48 To 13
Assigning 136 To 14
Assigning 68 To 15
Assigning 65 To 16
Assigning 130 To 17
Assigning 34 To 18
Assigning 17 To 19
Assigning 12 To 20
Assigning 80 To 21
Assigning 160 To 22
Assigning 72 To 23
Assigning 132 To 24
Assigning 33 To 25
Assigning 18 To 26
Assigning 5 To 27
Assigning 10 To 28
Assigning 138 To 29
Assigning 69 To 30
Assigning 50 To 31
Assigning 49 To 32
Assigning 140 To 33
Assigning 76 To 34
Assigning 162 To 35
Assigning 81 To 36
Assigning 164 To 37
Assigning 88 To 38
Assigning 161 To 39
Assigning 82 To 40
Assigning 74 To 41
Assigning 133 To 42
Assigning 26 To 43
Assigning 37 To 44
Assigning 90 To 45
Assigning 165 To 46
;
The direction_raw map must now be edited to make sure that the shortest path is found, particularly in intersections and junctions. The actual editing depends on the real network
(road) features, see travel cost and path length.
direction = manual edit of direction_raw
The edited values are displayed in color in the directions map, unedited cells are in grayscale.
