unanmed 6f0f17fbf2 refactor(02-02): replace linear min-scan with binary heap priority queue in pathfinding search ... - Add internal DistanceHeap (binary min-heap, lazy stale-entry skip) colocated in finder.ts - search() extraction now pops the heap instead of scanning the full dist map - Restore NaN-aware cost guard (!Number.isFinite || < 0) dropped in 622008f, fixes NaN warn-174 regression test		2026-09-09 19:15:25 +08:00
..
src	refactor(02-02): replace linear min-scan with binary heap priority queue in pathfinding search	2026-09-09 19:15:25 +08:00
package.json	refactor: Layer2 数据拆分至 data-system	2026-05-16 17:06:18 +08:00