rihla 0.1.0__tar.gz

rihla-0.1.0/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

rihla-0.1.0/NOTICE

@@ -0,0 +1,2 @@
+Rihla
+Copyright 2026 Leandro Garcia

rihla-0.1.0/PKG-INFO

@@ -0,0 +1,227 @@
+Metadata-Version: 2.4
+Name: rihla
+Version: 0.1.0
+Summary: Flexible multi-leg, multi-airport flight search that finds the cheapest route across an entire itinerary.
+Author: Leandro Garcia
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/leojg/rihla
+Project-URL: Repository, https://github.com/leojg/rihla
+Project-URL: Issues, https://github.com/leojg/rihla/issues
+Project-URL: Changelog, https://github.com/leojg/rihla/blob/master/CHANGELOG.md
+Keywords: flights,flight-search,travel,itinerary,mcp,mcp-server
+Classifier: Development Status :: 4 - Beta
+Classifier: Environment :: Console
+Classifier: Intended Audience :: Developers
+Classifier: Intended Audience :: End Users/Desktop
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Topic :: Internet
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+License-File: NOTICE
+Requires-Dist: python-dotenv
+Provides-Extra: mcp
+Requires-Dist: mcp>=1.0; extra == "mcp"
+Provides-Extra: dev
+Requires-Dist: pytest; extra == "dev"
+Requires-Dist: ruff; extra == "dev"
+Dynamic: license-file
+
+# Rihla
+
+> **Rihla** (رحلة), *"the journey."* Named for Ibn Battuta's 14th-century travelogue —
+> the record of history's farthest-traveling explorer, who left Tangier for Mecca and
+> kept going for 29 years and 75,000 miles.
+
+Flexible multi-leg, multi-airport flight search that finds the cheapest route across an
+**entire itinerary** — available as a CLI and as an MCP server for AI agents.
+
+Consumer flight sites price one leg at a time. Rihla treats the whole trip as a single
+optimization problem:
+
+> *"Leave Montevideo — or Buenos Aires, it's a ferry ride away — around September 15
+> for Europe. Stay 20–30 days, then Japan for 15, then home. What's the cheapest
+> combination?"*
+
+That query has three legs, flexible airports on both ends of each, a flexible departure
+window, and stay-duration constraints linking the legs. Rihla prices each leg's
+date×airport grid once, then finds the cheapest valid combinations in pure local
+compute — so even a 3–4 leg flexible query costs only a handful of API calls.
+
+```
+1. 1,297 USD   (44 days door-to-door)
+     MVD -> AMS  2026-09-08  $    383  [mock, cached]  AA AA127
+     FRA -> NRT  2026-10-07  $    481  [mock, cached]  KL KL411
+     HND -> EZE  2026-10-22  $    433  [mock, cached]  AZ AZ933
+
+2. 1,308 USD   (44 days door-to-door)
+     MVD -> AMS  2026-09-14  $    446  [mock, cached]  AA AA127
+     ...
+```
+
+Note the airport substitution at work: it enters Europe through Amsterdam, leaves from
+Frankfurt, and flies home into Buenos Aires — each leg independently picks the cheapest
+airport pair from its sets.
+
+## Quick start
+
+Requires Python ≥ 3.10.
+
+```bash
+pip install rihla            # CLI
+pip install "rihla[mcp]"     # CLI + MCP server
+```
+
+Runs offline out of the box (no keys needed — a deterministic mock data source):
+
+```bash
+RIHLA_PROFILE=mock rihla                # the canonical demo trip above
+rihla examples/queries/canonical.json   # same trip, from a query file
+rihla -i                                # build a query interactively
+```
+
+For live prices, copy `.env.example` to `.env` and add at least a
+[Travelpayouts](https://www.travelpayouts.com) token (free). See
+[Data sources](#data-sources--profiles).
+
+## Writing a query
+
+A query is a small JSON file: your origin airports, the ordered stops, a departure
+window for the first leg, and how long to stay at each stop. Downstream date windows
+are derived — you never hand-compute "if I leave Sep 15 and stay 20–30 days, when do I
+fly to Tokyo?"
+
+```json
+{
+  "origins": ["MVD", "EZE", "AEP"],
+  "stops": ["EUROPE", ["NRT", "HND"], "MVD_AREA"],
+  "earliest": "2026-09-08",
+  "latest": "2026-09-22",
+  "stays": [[20, 30], [15, 15]],
+  "date_step": 3,
+  "top": 5
+}
+```
+
+- **`origins`** — IATA codes tried as one origin set; the cheapest wins per date.
+- **`stops`** — each stop is a region name or a list of IATA codes. Built-in regions:
+  `EUROPE` (MAD, BCN, LIS, CDG, FCO, AMS, FRA), `TOKYO` (NRT, HND), `MVD_AREA`
+  (MVD, EZE, AEP). Make the last stop your origin set to fly home.
+- **`earliest` / `latest`** — the departure window for the *first* leg only.
+- **`stays`** — `[min, max]` nights at each intermediate stop
+  (`len(stays) == len(stops) - 1`).
+- **`date_step`** — sample every N days across date windows (coarser = fewer API calls).
+- **`top`** — how many ranked combinations to return.
+- **`currency`** — optional ISO 4217 code (default `USD`).
+
+`rihla -i` walks you through these questions and prints the resulting JSON to save for
+reuse. Add `--links` to any run to show booking URLs.
+
+## Reading results
+
+Rihla is honest about data quality rather than pretending everything is bookable:
+
+- Each flight is tagged with its source, and `cached` when the price is **indicative**
+  (Travelpayouts data is aggregated search history, not a live fare) versus a real,
+  bookable fare (SerpApi / Google Flights).
+- If some legs can't be priced (thin routes are real — cached sources have gaps), you
+  get a **partial** result over the legs that were found, never a silently wrong total.
+- For unpriced legs, Rihla shows the nearest cached fares *outside* your departure
+  window — a hint to shift or widen dates.
+
+Ranking is price-only in v0.1. Open-jaw within a region is allowed by default (enter
+Europe at one city, leave from another); the cost of repositioning inside the region is
+not modeled.
+
+## Data sources & profiles
+
+| Source | Role | Cost | Notes |
+|---|---|---|---|
+| **Travelpayouts / Aviasales** | Primary | Free | Cached, redistribution-licensed. A month of prices per call, so the call budget stays tiny. Prices indicative; coverage follows route popularity. |
+| **SerpApi** (Google Flights) | Fill | 250 free searches/mo (BYO key) | Real bookable fares; fills routes Travelpayouts misses. Only spent on uncovered routes. |
+| **Mock** | Offline | — | Deterministic fake prices for development and demos. |
+
+Configure via `.env` (see `.env.example`) or environment variables:
+`TRAVELPAYOUTS_TOKEN`, `SERPAPI_KEY`, and `RIHLA_PROFILE`:
+
+- `local` (default) — every source whose key is set, including SerpApi.
+- `hosted` — redistribution-licensed sources only (SerpApi disabled: it scrapes Google,
+  so **do not serve it from a public hosted instance**).
+- `mock` — force the offline fetcher, no network.
+
+With no keys set, Rihla falls back to the mock source and says so.
+
+## MCP server
+
+Rihla ships an MCP server (stdio) so agents like Claude can run trip searches:
+
+```bash
+pip install "rihla[mcp]"
+claude mcp add rihla -- rihla-mcp        # Claude Code
+```
+
+or in any MCP client config:
+
+```json
+{
+  "mcpServers": {
+    "rihla": {
+      "command": "rihla-mcp",
+      "env": {
+        "TRAVELPAYOUTS_TOKEN": "your-token",
+        "SERPAPI_KEY": "your-key"
+      }
+    }
+  }
+}
+```
+
+(The server also loads a `.env` from its working directory, so `env` is optional if you
+run it from a checkout.)
+
+It exposes two read-only tools with an enforced etiquette:
+
+1. **`resolve_airports`** — the agent proposes IATA codes for the traveler's named
+   places; Rihla validates and enriches them (nearby alternatives included). Cheap and
+   quota-free.
+2. **`search_trip`** — the priced, quota-limited search. Tool descriptions instruct the
+   agent to get the traveler's explicit confirmation of the airports *before* spending
+   quota here.
+
+mcp-name: io.github.leojg/rihla
+
+## How it works
+
+Leg prices are independent — the MVD→Europe fare doesn't depend on the Tokyo dates. So
+Rihla fetches each leg's date×airport grid **once**, then enumerates valid date
+combinations (respecting the stay constraints) entirely in memory. The combinatorial
+explosion lives in local compute, not in API calls.
+
+```
+core.py            data model + the pure optimizer (no I/O)
+fetchers/          PriceFetcher protocol: Mock / Travelpayouts / SerpApi + merge
+places.py          airport sets / regions
+api.py             search_trip: serializable query in, result dict out
+cli.py             thin CLI over search_trip
+mcp_server.py      thin MCP wrapper over the same seam
+```
+
+Adding a data source (Duffel, Kiwi, …) is one more class implementing a one-method
+protocol: `quote(origin, dest, day) -> Quote`.
+
+**Scope (v0.1):** flight search only — no lodging, no booking or payments, single adult,
+one cabin. Search returns booking links, never handles the transaction.
+
+## Development
+
+```bash
+git clone https://github.com/leojg/rihla && cd rihla
+pip install -e ".[dev,mcp]"
+pytest              # offline, no keys needed
+ruff check .
+```
+
+## License
+
+Licensed under the Apache License 2.0 — see [LICENSE](LICENSE).

rihla-0.1.0/README.md

@@ -0,0 +1,197 @@
+# Rihla
+
+> **Rihla** (رحلة), *"the journey."* Named for Ibn Battuta's 14th-century travelogue —
+> the record of history's farthest-traveling explorer, who left Tangier for Mecca and
+> kept going for 29 years and 75,000 miles.
+
+Flexible multi-leg, multi-airport flight search that finds the cheapest route across an
+**entire itinerary** — available as a CLI and as an MCP server for AI agents.
+
+Consumer flight sites price one leg at a time. Rihla treats the whole trip as a single
+optimization problem:
+
+> *"Leave Montevideo — or Buenos Aires, it's a ferry ride away — around September 15
+> for Europe. Stay 20–30 days, then Japan for 15, then home. What's the cheapest
+> combination?"*
+
+That query has three legs, flexible airports on both ends of each, a flexible departure
+window, and stay-duration constraints linking the legs. Rihla prices each leg's
+date×airport grid once, then finds the cheapest valid combinations in pure local
+compute — so even a 3–4 leg flexible query costs only a handful of API calls.
+
+```
+1. 1,297 USD   (44 days door-to-door)
+     MVD -> AMS  2026-09-08  $    383  [mock, cached]  AA AA127
+     FRA -> NRT  2026-10-07  $    481  [mock, cached]  KL KL411
+     HND -> EZE  2026-10-22  $    433  [mock, cached]  AZ AZ933
+
+2. 1,308 USD   (44 days door-to-door)
+     MVD -> AMS  2026-09-14  $    446  [mock, cached]  AA AA127
+     ...
+```
+
+Note the airport substitution at work: it enters Europe through Amsterdam, leaves from
+Frankfurt, and flies home into Buenos Aires — each leg independently picks the cheapest
+airport pair from its sets.
+
+## Quick start
+
+Requires Python ≥ 3.10.
+
+```bash
+pip install rihla            # CLI
+pip install "rihla[mcp]"     # CLI + MCP server
+```
+
+Runs offline out of the box (no keys needed — a deterministic mock data source):
+
+```bash
+RIHLA_PROFILE=mock rihla                # the canonical demo trip above
+rihla examples/queries/canonical.json   # same trip, from a query file
+rihla -i                                # build a query interactively
+```
+
+For live prices, copy `.env.example` to `.env` and add at least a
+[Travelpayouts](https://www.travelpayouts.com) token (free). See
+[Data sources](#data-sources--profiles).
+
+## Writing a query
+
+A query is a small JSON file: your origin airports, the ordered stops, a departure
+window for the first leg, and how long to stay at each stop. Downstream date windows
+are derived — you never hand-compute "if I leave Sep 15 and stay 20–30 days, when do I
+fly to Tokyo?"
+
+```json
+{
+  "origins": ["MVD", "EZE", "AEP"],
+  "stops": ["EUROPE", ["NRT", "HND"], "MVD_AREA"],
+  "earliest": "2026-09-08",
+  "latest": "2026-09-22",
+  "stays": [[20, 30], [15, 15]],
+  "date_step": 3,
+  "top": 5
+}
+```
+
+- **`origins`** — IATA codes tried as one origin set; the cheapest wins per date.
+- **`stops`** — each stop is a region name or a list of IATA codes. Built-in regions:
+  `EUROPE` (MAD, BCN, LIS, CDG, FCO, AMS, FRA), `TOKYO` (NRT, HND), `MVD_AREA`
+  (MVD, EZE, AEP). Make the last stop your origin set to fly home.
+- **`earliest` / `latest`** — the departure window for the *first* leg only.
+- **`stays`** — `[min, max]` nights at each intermediate stop
+  (`len(stays) == len(stops) - 1`).
+- **`date_step`** — sample every N days across date windows (coarser = fewer API calls).
+- **`top`** — how many ranked combinations to return.
+- **`currency`** — optional ISO 4217 code (default `USD`).
+
+`rihla -i` walks you through these questions and prints the resulting JSON to save for
+reuse. Add `--links` to any run to show booking URLs.
+
+## Reading results
+
+Rihla is honest about data quality rather than pretending everything is bookable:
+
+- Each flight is tagged with its source, and `cached` when the price is **indicative**
+  (Travelpayouts data is aggregated search history, not a live fare) versus a real,
+  bookable fare (SerpApi / Google Flights).
+- If some legs can't be priced (thin routes are real — cached sources have gaps), you
+  get a **partial** result over the legs that were found, never a silently wrong total.
+- For unpriced legs, Rihla shows the nearest cached fares *outside* your departure
+  window — a hint to shift or widen dates.
+
+Ranking is price-only in v0.1. Open-jaw within a region is allowed by default (enter
+Europe at one city, leave from another); the cost of repositioning inside the region is
+not modeled.
+
+## Data sources & profiles
+
+| Source | Role | Cost | Notes |
+|---|---|---|---|
+| **Travelpayouts / Aviasales** | Primary | Free | Cached, redistribution-licensed. A month of prices per call, so the call budget stays tiny. Prices indicative; coverage follows route popularity. |
+| **SerpApi** (Google Flights) | Fill | 250 free searches/mo (BYO key) | Real bookable fares; fills routes Travelpayouts misses. Only spent on uncovered routes. |
+| **Mock** | Offline | — | Deterministic fake prices for development and demos. |
+
+Configure via `.env` (see `.env.example`) or environment variables:
+`TRAVELPAYOUTS_TOKEN`, `SERPAPI_KEY`, and `RIHLA_PROFILE`:
+
+- `local` (default) — every source whose key is set, including SerpApi.
+- `hosted` — redistribution-licensed sources only (SerpApi disabled: it scrapes Google,
+  so **do not serve it from a public hosted instance**).
+- `mock` — force the offline fetcher, no network.
+
+With no keys set, Rihla falls back to the mock source and says so.
+
+## MCP server
+
+Rihla ships an MCP server (stdio) so agents like Claude can run trip searches:
+
+```bash
+pip install "rihla[mcp]"
+claude mcp add rihla -- rihla-mcp        # Claude Code
+```
+
+or in any MCP client config:
+
+```json
+{
+  "mcpServers": {
+    "rihla": {
+      "command": "rihla-mcp",
+      "env": {
+        "TRAVELPAYOUTS_TOKEN": "your-token",
+        "SERPAPI_KEY": "your-key"
+      }
+    }
+  }
+}
+```
+
+(The server also loads a `.env` from its working directory, so `env` is optional if you
+run it from a checkout.)
+
+It exposes two read-only tools with an enforced etiquette:
+
+1. **`resolve_airports`** — the agent proposes IATA codes for the traveler's named
+   places; Rihla validates and enriches them (nearby alternatives included). Cheap and
+   quota-free.
+2. **`search_trip`** — the priced, quota-limited search. Tool descriptions instruct the
+   agent to get the traveler's explicit confirmation of the airports *before* spending
+   quota here.
+
+mcp-name: io.github.leojg/rihla
+
+## How it works
+
+Leg prices are independent — the MVD→Europe fare doesn't depend on the Tokyo dates. So
+Rihla fetches each leg's date×airport grid **once**, then enumerates valid date
+combinations (respecting the stay constraints) entirely in memory. The combinatorial
+explosion lives in local compute, not in API calls.
+
+```
+core.py            data model + the pure optimizer (no I/O)
+fetchers/          PriceFetcher protocol: Mock / Travelpayouts / SerpApi + merge
+places.py          airport sets / regions
+api.py             search_trip: serializable query in, result dict out
+cli.py             thin CLI over search_trip
+mcp_server.py      thin MCP wrapper over the same seam
+```
+
+Adding a data source (Duffel, Kiwi, …) is one more class implementing a one-method
+protocol: `quote(origin, dest, day) -> Quote`.
+
+**Scope (v0.1):** flight search only — no lodging, no booking or payments, single adult,
+one cabin. Search returns booking links, never handles the transaction.
+
+## Development
+
+```bash
+git clone https://github.com/leojg/rihla && cd rihla
+pip install -e ".[dev,mcp]"
+pytest              # offline, no keys needed
+ruff check .
+```
+
+## License
+
+Licensed under the Apache License 2.0 — see [LICENSE](LICENSE).

rihla-0.1.0/pyproject.toml

@@ -0,0 +1,47 @@
+[build-system]
+requires = ["setuptools>=77"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "rihla"
+version = "0.1.0"
+description = "Flexible multi-leg, multi-airport flight search that finds the cheapest route across an entire itinerary."
+readme = "README.md"
+requires-python = ">=3.10"
+license = "Apache-2.0"
+license-files = ["LICENSE", "NOTICE"]
+authors = [{ name = "Leandro Garcia" }]
+keywords = ["flights", "flight-search", "travel", "itinerary", "mcp", "mcp-server"]
+classifiers = [
+    "Development Status :: 4 - Beta",
+    "Environment :: Console",
+    "Intended Audience :: Developers",
+    "Intended Audience :: End Users/Desktop",
+    "Operating System :: OS Independent",
+    "Programming Language :: Python :: 3",
+    "Topic :: Internet",
+]
+dependencies = [
+    "python-dotenv",  # load credentials from a local .env in the CLI
+]
+# Live fetchers (Travelpayouts, SerpApi) use stdlib urllib - no extra runtime deps yet.
+# httpx joins at the MCP milestone (M5) for async/concurrent fetching.
+
+[project.urls]
+Homepage = "https://github.com/leojg/rihla"
+Repository = "https://github.com/leojg/rihla"
+Issues = "https://github.com/leojg/rihla/issues"
+Changelog = "https://github.com/leojg/rihla/blob/master/CHANGELOG.md"
+
+[project.optional-dependencies]
+# MCP server: pip install "rihla[mcp]"
+mcp = ["mcp>=1.0"]
+# Tooling for local development: pip install -e ".[dev]"
+dev = ["pytest", "ruff"]
+
+[project.scripts]
+rihla = "rihla.cli:main"
+rihla-mcp = "rihla.mcp_server:main"
+
+[tool.setuptools.packages.find]
+where = ["src"]

rihla-0.1.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+