Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
-
Updated
Nov 17, 2025 - Python
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
The BMSSP algorithm
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths (BMSSP) algorithm - Java implementation
A distance vector routing and fastest path algorithm implemented in Go.
Algorithm for Multidisciplinary Design Project (CZ3004)
Airflow 3 pipeline comparing NYC taxi vs. Citi Bike travel times. Ingests two heterogeneous sources every 15 min, maps bike stations to taxi zones, and loads an idempotent serving layer. Based on Chapter 13 of Data Pipelines with Apache Airflow, 2nd Ed.
Year-3 Module taken in NTU that requires a group of team members to implement a robot that can explore and find the fastest path in a maze
To associate your repository with the fastest-path topic, visit your repo's landing page and select "manage topics."