# Veyra: Find the shortest way

> A pure pathfinding core (BFS, Dijkstra, A*, greedy best-first) over a weighted 4-connected grid with a binary min-heap, returning both the path and the frontier visit order. 12 tests, including that A* with an admissible heuristic matches Dijkstra's optimal cost.

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.

## About the app

Graph search

## What to take away

- A pure pathfinding core (BFS, Dijkstra, A*, greedy best-first) over a weighted 4-connected grid with a binary min-heap, returning both the path and the frontier visit order. 12 tests, including that A* with an admissible heuristic matches Dijkstra's optimal cost.
- Download: Veyra (ZIP)

## Tags

Free software, Veyra

## Read the full write-up

/downloads/veyra.zip

## We build this for clients

https://dfieldsolutions.com/en/services/full-stack

## More from the lab

- https://dfieldsolutions.com/en/lab/sylex.md — Sylex: Make sense of the slashes
- https://dfieldsolutions.com/en/lab/kindra.md — Kindra: Miss a beat, not the rhythm
- https://dfieldsolutions.com/en/lab/voxara.md — Voxara: Argue better. Lose gracefully
- https://dfieldsolutions.com/en/lab/wraithward.md — Wraithward: Spot the bait before you bite

---

Source: https://dfieldsolutions.com/en/lab/veyra
DField Solutions — Torony köz 5-1.a, 2120 Dunakeszi, Hungary — +36 20 722 0002 — dezso@dfieldsolutions.com
Booking: see https://dfieldsolutions.com/en/contact