MFworks Tutorial – 17 Shortest Path I+II

Now, the shortest path(s) can be extracted as follows:

ShortestPath_time2 = Recode ShortestPath4_InNetwork_time2
Assigning 999 To 83…85
;

For time interval 1, first add proximity surfaces, then extract path.
SpreadFromCutoff4_time1 = Spread Cutoff_Point4
To 600
In costoftravel_time1
Outof direction
;

ShortestPath_InNetwork_time1 = SpreadFromStart_Time1
+ SpreadFromCutoff4_time1
;

ShortestPath_time1 = Recode ShortestPath_InNetwork_time1
Assigning 999 To 169…171;

The extracted paths can now be joined and overlayed over the study area map for visualization.

ShortestPath_time = Cover ShortestPath_time1 With ShortestPath_time2
;

ShortestPath_OverMap_time = Cover BrownsPond With ShortestPath_time
;

MFworks – step by step

•  01 MFworks

• 02 Network Modelling

•  03 Incremental Linkage

• 04 Directional Identifier

• 05 Cost surface

• 06 Travel cost – path length

•  07 Dynamic Cost Surface

•  08 Artefacts

• 09 Map Layers Needed

•  10 Deriving Linkage

• 11 Deriving Directions

• 12 Deriving the Shortest Path

• 13 Viewing the Shortest Path

• 14 Dynamic Networks

• 15 Shortest Path I

• 16 Shortest Path II

• 17 Shortest Path I+II