routing.pathfinding.finder.dijkstra

Dijkstra: the compiled search without heuristic.

class routing.pathfinding.finder.dijkstra.DijkstraFinder(diagonal_movement: int = 2, **keywords: object)

Bases: Finder

Dijkstra pathfinding: the cheapest path, no heuristic.