Note: Distances are those given by Chay0s and Bobby Stewart. They
did a lot of the work.
I used their information to get an array of origin->destination distances.
I then used this array in Dijkstra's algorithm to compute the shortest
path from all origins to all destinations.
The total time in hours is based on a rough estimate of the average
terrain type between destinations. This should not be viewed as absolute.
I used a terrain type modifier of 0.75. The DMG doesn't have an entry for
Desert with road, but I averaged the terrain modifier between Highway (1)
and Trackless(0.5). The results shown for travel time are given for a
humanoid with base speed of 30 feet.
- Gab