Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those d… ...

Next, a different routing of the arcs is obtained by specifying the DP and the HTRACKS= options. As a result of these options, the NETDRAW procedure uses a dynamic programming algorithm to route the ...

The new algorithm handles changes consisting of deleted edges -- for example, if the equivalent of a stretch of a road suddenly becomes inaccessible due to roadworks.