dodgr

Distances on dual-weighted directed graphs using priority-queue shortest paths (Padgham (2019) doi:10.32866/6945). Weighted directed graphs have weights from A to B which may differ from those from B to A. Dual-weighted directed graphs have two sets of such weights. A canonical example is a street network to be used for routing in which routes are calculated by weighting distances according to the type of way and mode of transport, yet lengths of routes must be calculated from direct distances.

Last 30 days

This package has been downloaded 1,183 times in the last 30 days. Now we’re talking! This work is officially 'heard of in academic circles', just like those wild research papers on synthetic bananas. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 58 times.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.

Last 365 days

This package has been downloaded 11,643 times in the last 365 days. That's enough downloads to make it mildly famous in niche technical communities. A badge of honor! The day with the most downloads was Feb 12, 2025 with 142 downloads.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.