https://github.com/d4ve10/bellman-ford-gtfs

A project to find the shortest path in a GTFS dataset using the Bellman-Ford algorithm
https://github.com/d4ve10/bellman-ford-gtfs

bellman-ford bellman-ford-algorithm gtfs gtfs-static gtfs-visualizer transit transport

Last synced: 3 months ago
JSON representation

A project to find the shortest path in a GTFS dataset using the Bellman-Ford algorithm

• Host: GitHub
• URL: https://github.com/d4ve10/bellman-ford-gtfs
• Owner: d4ve10
• License: mit
• Created: 2024-07-23T19:06:42.000Z (10 months ago)
• Default Branch: main
• Last Pushed: 2024-07-25T12:49:05.000Z (10 months ago)
• Last Synced: 2024-07-26T14:30:09.505Z (10 months ago)
• Topics: bellman-ford, bellman-ford-algorithm, gtfs, gtfs-static, gtfs-visualizer, transit, transport
• Language: Jupyter Notebook
• Homepage:
• Size: 1.32 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
## Bellman-Ford implementation based on the GTFS format

![Visualisation](images/all_connections.png)

This project is a simple implementation of the Bellman-Ford algorithm to find the shortest path between two stops in a GTFS dataset.

### Installation

To install all the python packages, you can run the following command:

```bash

pip install -r requirements.txt

```

### Dataset

The dataset used in this project is the "Long Distance Rail Germany" GTFS dataset from the [Germany GTFS Feed](https://gtfs.de/en/feeds/) website. You can also use any other GTFS dataset you like. \

If you want to use another dataset, put the content in a new directory under the `gtfs` directory and change the `gtfs_dataset` variable in the `notebooks/config.py` file to the corresponding directory name.

### Usage

To run the project, first run the `notebooks/preprocessing.ipynb` notebook to preprocess the GTFS dataset. This should create a new `.csv` file inside the `data` directory with the same filename as the directory name from the dataset. \

Then, you can run the `notebooks/find_route.ipynb` notebook to find the shortest path between two stops at a specific time which can be changed freely. \

Additionally, you can run the `notebooks/visualize_all_nodes.ipynb` notebook to visualize all the nodes and edges of the dataset.