Visual Field Example 10 - SF Street Network Shortest Path Example.

The source data this example is based upon

• San Francisco Street Nodes. CSV Dataset
• San Francisco Streets - Active and Retired (Street Edges). CSV Dataset
• San Francisco Streets Speed Limits. CSV Dataset

Key aspects this example demonstrates

• Fetching 3 CSV datasets. 2 of the datasets form the nodes and edges of a network graph. Also these 2 datasets have a spatial component so this can be modelled as a physical network.
• Applying a Custom Function (Turf.length) to compute the length of each edge segment in miles of the spatial geometry linestring.
• Using the length of each segment and speed limit of each segment to compute the approximate driving time for each segment. Note that some modeling constants are used; 1) average segment driving speed is modelled at 0.8 of the speed limit, and 2) each intersection is modelled at 5 seconds cost.
• Modelling a directed network based on the Street dataset "oneway" data attribute.
• Creation of a Physical Newtork Map Visualization with explore capabilities and cost based shortest path searches.

Additional Information

• View this example stand alone
• View the metadata used in this example

visualfield.org