v1.4.0 — faster search + safer input
Highlights
- Performance: O(1) vertex lookup via a name index (was O(V) linear scan). Searches are ~4–40× faster (gap widens with graph size) with far fewer allocations — no API change.
- Correctness:
VertexAddnow rejects edges with negative weights (Dijkstra requires non-negative weights) instead of silently returning a wrong path. - Tooling: GitHub Actions CI (build/vet/test matrix + race/coverage + gofmt),
FuzzDijkstraSearch,BenchmarkDijkstraSearch, and tests for previously-uncovered public API (coverage 57% → 68%).
See CHANGELOG.md.