searchBars
Flight search with minimum connection time
A search that solves a shortest path over a network of 25 flights across nine airports where a layover only counts if the departure falls after the previous arrival plus a variable connection time, which grows on a carrier change, on an international leg and on a terminal change. It computes the fastest and the cheapest itinerary under the same rules and shows them together so you can see they do not match, with the real slack and the required minimum on every layover, tight connections in amber and a panel listing the links rejected as impossible connections.
See it live and copy its promptWhat you can adjust
- Base minimum connection
- Airline change extra
- International flight extra
- Accent color
- Tight connection color
- Panel height
- Rejected legs
- Animation speed
How this catalog works
Every component ships with its reproduction prompt: the text you paste into an AI builder to get exactly this piece. The values above are editable, and the prompt you copy carries the ones you chose, so what gets generated is what you were looking at.
