A Python Algorithm for Shortest-Path River Network Distance Calculations Considering River Flow Direction

Abstract

Vector based shortest path analysis in geographic information system (GIS) is well established for road networks. Even though these network algorithms can be applied to river layers, they do not generally consider the direction of flow. This paper presents a Python 3.7 program (upstream_downstream_shortests_path_dijkstra.py) that was specifically developed for river networks. It implements multiple single-source (one to one) weighted Dijkstra shortest path calculations, on a list of provided source and target nodes, and returns the route geometry, the total distance between each source and target node, and the total upstream and downstream distances for each shortest path. The end result is similar to what would be obtained by an “all-pairs” weighted Dijkstra shortest path algorithm. Contrary to an “all-pairs” Dijkstra, the algorithm only operates on the source and target nodes that were specified by the user and not on all of the nodes contained within the graph. For efficiency, only the upper distance matrix is returned (e.g., distance from node A to node B), while the lower distance matrix (e.g., distance from nodes B to A) is not. The program is intended to be used in a multiprocessor environment and relies on Python’s multiprocessing package.

Introducing climate change into the biochemistry and molecular biology curriculum

“…This graph would easily be shown when discussing the cell cycle, which is driven by oscillating levels of active cyclic‐dependent protein kinase 1 26 . An in‐class activity to access and plot CO 2 and temperature over the last 450,000 years available 27 …”

“…(Top) Correlations between CO 2 from continuous Antarctic ice cores and proxy temperature variations over the last 500,000 years 22,26,27 . (Bottom) Fe and n‐alkane deposition in the Southern Ocean over the last 500,000 year 22,26,27 …”

Handling Dataset with Geophysical and Geological Variables on the Bolivian Andes by the GMT Scripts

“…The fundamental differences in their structure entail various means of their handling and processing. The use of scripts for processing cartographic data brings significant improvements to the mapping process [1][2][3][4][5]. Examples of such applications include the modules of GMT for cartographic tasks of data visualisation.…”