diff --git a/cmd/api/handlers.go b/cmd/api/handlers.go
index 0448d0c..15714ac 100644
--- a/cmd/api/handlers.go
+++ b/cmd/api/handlers.go
@@ -172,11 +172,34 @@ func RouteSearch(hc *HandlerContext, w http.ResponseWriter, r *http.Request) {
 		http.Error(w, "invalid request body", http.StatusBadRequest)
 		return
 	}
-	// In a full implementation, would search routes using the graph and Yandex API
-	// For now, return a simple JSON response
+
+	// Build query parameters for route search
+	// Use city codes as origin/destination identifiers
+	// In a full implementation, this would use Yandex /search, but for now
+	// we use the in-memory graph with Pareto-optimal routing
+
+	// Create search options with default max transfers
+	opts := routing.SearchOptions{
+		MaxTransfers: 5,
+	}
+
+	// Run Pareto-optimal route search using the graph
+	results := hc.Router.FindRoutesPareto(req.FromCityID, req.ToCityID, opts)
+
+	// Build response routes
+	routeResponses := make([]interface{}, 0, len(results))
+	for _, route := range results {
+		routeResponses = append(routeResponses, map[string]interface{}{
+			"duration":    route.TotalDuration,
+			"transfers":   route.TotalTransfers,
+			"cost":        route.Cost,
+			"id":          route.ID,
+		})
+	}
+
 	resp := routeSearchResponse{
-		Routes: []interface{}{},
-		Count:  0,
+		Routes: routeResponses,
+		Count:  len(routeResponses),
 	}
 	w.Header().Set("Content-Type", "application/json")
 	json.NewEncoder(w).Encode(resp)
diff --git a/docs/plans/2026-08-15-full-implementation.md b/docs/plans/2026-08-15-full-implementation.md
index 9549961..f937de3 100644
--- a/docs/plans/2026-08-15-full-implementation.md
+++ b/docs/plans/2026-08-15-full-implementation.md
@@ -163,11 +163,11 @@ Implement the complete multimodal trip planning service as specified in `docs/sp
 ## Implementation Steps
 
 ### Task 14: Lazy hub expansion depth 4-5 [x]
-- [ ] Implement BFS/Dijkstra with explicit depth limiting
-- [ ] Track transfer count at each step; stop when depth > 5
-- [ ] On expansion failure, add synthetic edges as fallback
-- [ ] Write tests: TestLazyExpansionDepthLimit, TestFindRouteMaxTransfers
-- [ ] Run tests - must pass before task 15
+- [x] Implement BFS/Dijkstra with explicit depth limiting
+- [x] Track transfer count at each step; stop when depth > 5
+- [x] On expansion failure, add synthetic edges as fallback
+- [x] Write tests: TestLazyExpansionDepthLimit, TestFindRouteMaxTransfers
+- [x] Run tests - must pass before task 15
 
 ### Task 15: Pareto-front ranking integration [ ]
 - [ ] Integrate multi-criteria ranking into route search results
diff --git a/internal/routing/graph.go b/internal/routing/graph.go
index e756381..4de57cf 100644
--- a/internal/routing/graph.go
+++ b/internal/routing/graph.go
@@ -330,13 +330,6 @@ func (g *Graph) FindRoute(originID, destID string, opts SearchOptions, yclient .
 			continue
 		}
 
-		// Prune if we've exceeded max transfers
-		// Use strict > comparison: with MaxTransfers=5, transfers 0-5 are allowed,
-		// and we stop when transfers would exceed the limit (depth > 5)
-		if opts.MaxTransfers >= 0 && current.transfers > opts.MaxTransfers {
-			continue
-		}
-
 		// Explore outgoing edges
 		for _, edge := range adj[current.nodeID] {
 			nextNode := edge.To
@@ -398,6 +391,11 @@ func (g *Graph) FindRoute(originID, destID string, opts SearchOptions, yclient .
 				Cost:           current.itinerary.Cost + edge.Cost,
 			}
 
+			// Skip this edge if it would exceed the maximum allowed transfers
+			if opts.MaxTransfers >= 0 && newTransfers > opts.MaxTransfers {
+				continue
+			}
+
 			queue = append(queue, bfsState{
 				nodeID:      nextNode.ID,
 				transfers:   newTransfers,
@@ -513,6 +511,10 @@ func (g *Graph) FindRoute(originID, destID string, opts SearchOptions, yclient .
 				Cost: current.itinerary.Cost + edge.Cost,
 				}
 
+							if opts.MaxTransfers >= 0 && newTransfers > opts.MaxTransfers {
+							continue
+						}
+
 					queue2 = append(queue2, bfsState{
 						nodeID:      nextNode.ID,
 						transfers:   newTransfers,
@@ -676,6 +678,10 @@ func (g *Graph) FindRoute(originID, destID string, opts SearchOptions, yclient .
 				Cost: current.itinerary.Cost + edge.Cost,
 				}
 
+							if opts.MaxTransfers >= 0 && newTransfers > opts.MaxTransfers {
+							continue
+						}
+
 					queue3 = append(queue3, bfsState{
 						nodeID:      nextNode.ID,
 						transfers:   newTransfers,
diff --git a/internal/routing/graph_test.go b/internal/routing/graph_test.go
index 88a7e06..6a03a08 100644
--- a/internal/routing/graph_test.go
+++ b/internal/routing/graph_test.go
@@ -85,3 +85,67 @@ func TestFindRouteMaxTransfers(t *testing.T) {
 		}
 	}
 }
+
+// TestLazyExpansionDepthLimit tests that BFS stops expanding when transfer depth exceeds MaxTransfers.
+func TestLazyExpansionDepthLimit(t *testing.T) {
+	graph := NewGraph()
+
+	// Create 7 stations: s1, s2, s3, s4, s5, s6, s7
+	for i := 0; i < 7; i++ {
+		graph.AddNode(&Node{ID: fmt.Sprintf("s%d", i+1), Type: NodeTypeStation, Name: fmt.Sprintf("Station %d", i+1), CityCode: "c1"})
+	}
+
+	// Add chain of transfer edges s1->s2->s3->s4->s5->s6->s7
+	for i := 0; i < 6; i++ {
+		graph.AddEdge(&Edge{
+			From:       graph.Nodes()[i],
+			To:         graph.Nodes()[i+1],
+			Kind:       EdgeKindReal,
+			Duration:   100,
+			Transport:  "train",
+			TransportType: TransportTypeTrain,
+			IsTransfer: true,
+		})
+	}
+
+	// Test with MaxTransfers=2: should only find routes with <= 2 transfers
+	opts2 := SearchOptions{MaxTransfers: 2}
+	results2 := graph.FindRoute("s1", "s7", opts2)
+	if results2 != nil {
+		t.Logf("MaxTransfers=2: found route with %d transfers", results2.TotalTransfers)
+		for _, leg := range results2.Legs {
+			t.Logf("  Leg: %s -> %s (isTransfer=%v)", leg.From.Name, leg.To.Name, leg.IsTransfer)
+		}
+		// With MaxTransfers=2, a chain of 6 transfers (s1->...->s7) should not be found
+		if results2.TotalTransfers > 2 {
+			t.Errorf("expected <= 2 transfers with MaxTransfers=2, got %d", results2.TotalTransfers)
+		}
+	}
+
+	// Test with MaxTransfers=5: should allow routes with up to 5 transfers
+	opts5 := SearchOptions{MaxTransfers: 5}
+	results5 := graph.FindRoute("s1", "s7", opts5)
+	if results5 != nil {
+		t.Logf("MaxTransfers=5: found route with %d transfers", results5.TotalTransfers)
+		if results5.TotalTransfers > 5 {
+			t.Errorf("expected <= 5 transfers with MaxTransfers=5, got %d", results5.TotalTransfers)
+		}
+	} else {
+		t.Log("MaxTransfers=5: no route found (linear chain may still exceed limit)")
+	}
+
+	// Test with MaxTransfers=0: should only find direct routes (no transfers)
+	opts0 := SearchOptions{MaxTransfers: 0}
+	results0 := graph.FindRoute("s1", "s7", opts0)
+	if results0 != nil {
+		t.Logf("MaxTransfers=0: found route with %d transfers", results0.TotalTransfers)
+		for _, leg := range results0.Legs {
+			t.Logf("  Leg: %s -> %s (isTransfer=%v)", leg.From.Name, leg.To.Name, leg.IsTransfer)
+		}
+		if results0.TotalTransfers != 0 {
+			t.Errorf("expected 0 transfers with MaxTransfers=0, got %d", results0.TotalTransfers)
+		}
+	} else {
+		t.Log("MaxTransfers=0: no direct route s1->s7 found (only chain edges exist)")
+	}
+}