MFworks Tutorial – 13 Viewing the Shortest Path

Now, the shortest path can be extracted.

ShortestPath = Recode ShortestPath_InNetwork
Assigning 999 To 262…264;

262-264 were the cell values for the shortest path. A high value of 999 was the chosen for the path to distinctively separate the path cells from any other cells in the following overlay:
The extracted path can be overlayed over the study area map for visualization.

ShortestPath_OverMap = Cover BrownsPond With ShortestPath ;

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