mapbox / mapbox/nepomuk

Improve Output of Search algorithms

Open
#79 1 comment 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Backend Feature Request
Dominant language
C++
Stars
24
Forks
7
PR merge metrics
No merged PRs in 30d

Description

The current implementation of our search algorithms simply output a list of stops without considering lines / transfers.

To allow reasonable annotation, we should augment the output of the transit search algorithms.
This output should probably consist of the following information:

- a list of stops and the line used to reach it - here we might need to distinguish between actual lines (from the data) and what is internally used as line. This could require a dedicated ID ?
- all transfers and their ID to allow correct annotation (type/...)

Possible further annotation requirements will be added to the ticket, as they arise.

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start by tracing the transit search algorithms and the current output that lists stops. Determine how routes, lines, transfers, and transfer IDs are represented in the existing GTFS-based data and search results. Done should mean search results expose enough stop, line, and transfer information for correct annotation, but the issue leaves the exact design and further requirements open.

Written by the indexing model from the issue text.

Assessment

Tech stack
cpp
Domain
backend
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.