Search Packages

dijkstra3d

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

solvor

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

pyvalhalla

Open Source Routing Engine for OpenStreetMap

pyvalhalla-weekly

Open Source Routing Engine for OpenStreetMap

pypetgraph

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

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.

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.

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.

algograph

Immutable graph library with 56+ algorithms, transformers, selectors, and lazy views

psycopgr

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

chinesepostman

My Python solution to the Chinese-Postman problem.