This repository contains Python code for running bidirectional Dijkstra experiments on large urban road networks. The code is designed to read preprocessed edge list files, construct graph data structures, and evaluate shortest path queries efficiently.
UE.ipynb: Main Jupyter notebook containing the implementation of theUEclass, graph reading utilities, and experimental evaluation scripts.file_paths.txt: List of file paths to preprocessed edge list files for different cities.readme.md: Project documentation.
- Python 3.10+
- numpy
- torch
Install dependencies with:
pip install numpy torch