LabVeyra: Find the shortest way

Veyra is a pathfinding visualizer with a pure core implementing BFS, Dijkstra, A*, and greedy best-first search over a weighted 4-connected grid, backed by a binary min-heap. Each run returns both the final path and the order in which the frontier was visited, so you can watch how each algorithm explores. It is a from-scratch, dependency-light build - 12 tests include the property that A* with an admissible heuristic matches Dijkstra's optimal cost - that you can download and run locally.