Vladimir Zagainov 39f20bff4f feat: implement routing graph and search algorithm (max 1 transfer) - Task 4 ...

- Create Graph type with Node/Edge types and methods
- Implement BuildGraphFromStations, SortEdges
- Implement BFS/Dijkstra FindRoute with 1-transfer limit
- Implement ApplyMCT for Minimum Connection Time rules
- Add search algorithm tests (success route, no-route, transfer limit)
- Add MCT application tests (city hub reduction, mode change)
- Update plan Task 4 checkboxes

2026-08-13 20:13:49 +03:00

..

graph_test.go

feat: implement routing graph and search algorithm (max 1 transfer) - Task 4

2026-08-13 20:13:49 +03:00

graph.go

feat: implement routing graph and search algorithm (max 1 transfer) - Task 4

2026-08-13 20:13:49 +03:00