Pathfinding3D

MIT License PyPI

Introduction

Pathfinding algorithms in 3D for python3 born from the fork of python-pathfinding by @brean.

Pathfinding3D is a comprehensive library designed for 3D pathfinding applications.

Currently there are 8 path-finders bundled in this library, namely:

  • A*: Versatile and most widely used algorithm.

  • Dijkstra: A* without heuristic.

  • Best-First

  • Bi-directional A*: Efficient for large graphs with a known goal.

  • Breadth First Search (BFS)

  • Iterative Deeping A* (IDA*): Memory efficient algorithm for large graphs.

  • Minimum Spanning Tree (MSP)

  • Theta*: Almost A* with path smoothing.

Dijkstra, A* and Bi-directional A* take the weight of the fields on the map into account. Theta* is a variant of A* but with any angle of movement allowed.