edgegraph.pathfinding.shortestpath

Algorithms for finding the shortest path between two points.

This module provides functions to solve the shortest path problem and its variants:

• Single pair shortest path; the shortest path between a known start and destination vertex

… and at this time, that’s all that’s implemented! More to come soon!

See also

Descriptive documentation about what solvers are implemented can be found here: Pathfinding.

Functions

single_pair_shortest_path(uni, start, dest, *)

Find the shortest path between two vertices in the given universe.