Mrixs/trip-planner
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix: address code review findings

Browse Source
This commit is contained in:
Vladimir Zagainov
2026-08-18 22:00:07 +03:00
parent 1513a9fb67
commit ef77b2c0a0
3 changed files with 5 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
internal/routing/graph.go
View File

@@ -915,7 +915,7 @@ type SearchResult struct {
// route in all three metrics simultaneously. Routes are sorted according to the RankingMode
// in SearchOptions: "fastest" (default, by duration), "fewest_transfers" (by transfers),
// or "cheapest" (by cost).
func (g *Graph) FindRoutesPareto(originID, destID string, opts SearchOptions, closedStations map[string]bool, neighbors map[string][]storage.StationNeighbor) []*Itinerary {
func (g *Graph) FindRoutesPareto(originID, destID string, opts SearchOptions, closedStations map[string]bool, neighbors map[string][]storage.StationNeighbor, yclient ...*yandex.Client) []*Itinerary {
// Run multiple searches with different strategies to find diverse routes
var allItineraries []*Itinerary
@@ -925,7 +925,7 @@ func (g *Graph) FindRoutesPareto(originID, destID string, opts SearchOptions, cl
optsCopy := opts
optsCopy.MaxTransfers = 5
result := g.FindRoute(originID, destID, optsCopy, closedStations, neighbors)
result := g.FindRoute(originID, destID, optsCopy, closedStations, neighbors, yclient...)
if result != nil && result.TotalDuration > 0 {
allItineraries = append(allItineraries, result)
}
@@ -934,7 +934,7 @@ func (g *Graph) FindRoutesPareto(originID, destID string, opts SearchOptions, cl
optsCopy := opts
optsCopy.MaxTransfers = maxTransfers
result := g.FindRoute(originID, destID, optsCopy, closedStations, neighbors)
result := g.FindRoute(originID, destID, optsCopy, closedStations, neighbors, yclient...)
if result != nil && result.TotalDuration > 0 {
allItineraries = append(allItineraries, result)
}