Shortest Paths Python Packages

extremitypathfinder

python package for fast shortest path computation on 2D polygon or grid maps

pandarm

pandas routing machine

path4gmns

An open-source, cross-platform, lightweight, and fast Python path engine for networks encoded in GMNS.

dyng

Dynamic graph and hypergraph algorithms on GPUs: keep shortest paths, cycle counts, triads and labels up to date under batch updates (C++17/CUDA, OpenMP; Python planned).

certflow

Certified route planning under drifting costs: conformal certificates (LB<=OPT<=UB), certificate-directed sensing, proof-gated ns-us preprocessing, and an observable-coverage layer (WATCH + Shiryaev-Roberts). 250 tests, validated on real METR-LA.

py-chenhancc

Using cython instead of PyBind11 generated by Binder. Rather straightforward. I am giving up on Binder to generate the library for Windows. This attempt is to create PXD files and use autowrap to generate the PYX files. Looks promising so far.

dijkstraalgo

To measure the shortest distance of any nodes or any particular points, we can use this package. By using this package, we will get the shortest path and also the distance.

pyift

PyIFT is a Python wrapper of a fork of the LIDS C library.

logtwothirds

Verified Rust/Python implementation and honest benchmark study of the Duan-Mao-Mao-Shu-Yin sorting-barrier shortest-path algorithm (BMSSP) vs Dijkstra

grape-mathlab

GRAph Parallel Environment

chenhancc

A faster python geodesic path cutting across mesh surface

kspath

Implements K shortest path algorithms for networkx