Dijkstra Python Packages

python-motion-planning

Motion planning(Path Planning and Trajectory Planning/Tracking) of AGV/AMR：python implementation of Dijkstra, A*, JPS, D*, LPA*, D* Lite, (Lazy)Theta*, RRT, RRT*, RRT-Connect, Informed RRT*, Voronoi, PID, DWA, APF, LQR, MPC, RPP, Bezier, Dubins etc.

pyvalhalla

Open Source Routing Engine for OpenStreetMap

solvor

Optimization solvers in pure Python: LP, MILP, SAT, constraint programming, graph and metaheuristics. No dependencies. Solvor all your optimization needs.

dijkstra3d

Dijkstra's Shortest Path for 6, 18, and 26-Connected 3D (Volumetric) Image Volumes

prezzemolo

Prezzemolo is a collection of classic data structure and algorithms that are useful in many different projects. The goal is to provide components that are robust, efficient and small.

pyvalhalla-weekly

Open Source Routing Engine for OpenStreetMap

pypetgraph

pypetgraph 是基于 Rust 著名图计算库 petgraph 的 Python 高性能封装。它利用 PyO3 实现了近乎原生的 Rust 计算速度，支持在节点和边上存储任意 Python 对象，并针对多核并发和异步 IO 进行了深度优化。

dijkstra3d-sparse

Dijkstra shortest paths, distance fields and connected components over sparse 3D voxel sets. Rust core, Python/NumPy API.

jupyddl

A dependency-free, pure-Python PDDL planning framework: parser, grounder, classical-to-SOTA planners, heuristics and a benchmarking harness

algograph

Immutable graph data structures and algorithms library with interactive shell

dijkstra

dijkstra is a native Python implementation of famous Dijkstra's shortest path algorithm. The implemented algorithm can be used to analyze reasonably large networks. The primary goal in design is the clarity of the program code. Thus, program code tends to be more educational than effective.

itinera

Anisotropic least-cost paths, corridors (LCC), FETE and PDI validation for archaeological movement modelling — a QGIS plugin built on numpy/scipy/GDAL, no external dependencies.

logtwothirds

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

pysochrone

This library is a Rust-powered Python library for fast local reachability, routing, and isochrone analysis on OpenStreetMap road networks. It builds a reusable SpatialGraph once, then runs repeated network-aware queries directly in process without deploying a server.

psycopgr

A Python wrapper of pgRouting for routing from nodes to nodes on real map.

larzgraph

Graphs and everyday algorithms (BFS/DFS, Dijkstra, components, topological sort, cycles, SCC) in pure Python. Zero dependencies.

pyvalhalla-smaller-tiles

Open Source Routing Engine for OpenStreetMap

chinesepostman

My Python solution to the Chinese-Postman problem.

graphways

This library is a Rust-powered Python library for fast local reachability, routing, and isochrone analysis on OpenStreetMap road networks. It builds a reusable SpatialGraph once, then runs repeated network-aware queries directly in process without deploying a server.

pyvalhalla-git

Open Source Routing Engine for OpenStreetMap