Module pathfinding 

Structs

Path

PathVisualizer

Converts paths to visual glyph data: a glowing trail along edges.

TrailSegment

Functions

all_pairs_shortest

Floyd-Warshall: all-pairs shortest paths.

astar

A* shortest path with a heuristic function.

bellman_ford

Bellman-Ford: single-source shortest paths, handles negative weights. Returns distances from start to all reachable nodes.

dijkstra

Dijkstra’s shortest path from start to end.