MFworks Tutorial – 12 Deriving the Shortest Path

Creating proximity surfaces from origin and destination and adding them yields the shortest path.

SpreadFromStart = Spread start
To 10000.00In costoftravel
Outof direction
;

SpreadFromStop = Spread stop
To 10000.00
In costoftravel
Outof direction
;

ShortestPath_InNetwork = SpreadFromStart + SpreadFromStop
;

The shortest path is delineated by the cells with the lowest value(s). The value is the actual cost of using this path. Using the Legend function this path can be derived by changing the color of the cells with the lowest value until a continuous path from origin to detination can be seen.

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