15917401a9
feat: complete lazy graph expansion implementation with cache-aware search and transfer depth limiting
...
- Task 1: Hub station selection and BuildGraphFromHubs
- Task 2: Yandex /search on-demand edge expansion with caching
- Task 3: FindRoute with lazy expansion and 4-5 transfer depth limit
- Task 4: Cache-aware search results with TTL policies (near-term: 2-6h, far-term: 7d)
- Task 5: End-to-end verification and documentation
- Task 6: Final verification - all internal/routing unit tests pass (22/22)
Co-Authored-By: Claude <noreply@anthropic.com >
2026-08-14 22:54:45 +03:00
6049d2e544
feat: verify end-to-end lazy graph expansion - Task 5 complete
...
All lazy graph expansion requirements verified:
- Lazy on-demand graph expansion with hub stations
- BFS/Dijkstra with depth limiting (4-5 transfers max)
- On-demand /search requests for relevant station pairs
- Aggressive caching with TTL policies
- Transfer limit enforcement
- MCT calculation during lazy expansion
2026-08-14 22:44:23 +03:00
0f95e3e2f8
feat: implement lazy graph expansion FindRoute with on-demand /search and transfer depth limit
2026-08-14 15:27:17 +03:00
bad78ea2fa
docs: mark Task 2 complete in plan
...
- Mark all Task 2 checkboxes as [x] in the plan file
- SearchRoutes method added to yandex client
- Hub expansion implemented via on-demand /search
- Cache key generation integrated
- Tests written for search integration and cache TTL policies
2026-08-14 14:14:58 +03:00
829e93fc8f
feat: implement lazy graph expansion - Task 1: hub station selection, BuildGraphFromHubs, and ExpandGraphLazy
2026-08-14 14:00:01 +03:00
d20fd71371
add plan: lazy-graph-expansion
2026-08-14 13:33:20 +03:00
