As part of our CSC1008 module, we were tasked to create a journey planner for the Singapore Public Transport System, utilizing data structures and algorithms taught to us. In this Journey Planner application, we utilized Dijkstra's Shortest Path Algorithm and Breadth-First-Search (BFS) to find possible paths a person can take for their journey.
Install all requirements through our requirements.txt file
pip install -r requirements.txtSimply run GUI.py in the main directory.
- Utilized PyQt5 for GUI
- Utilized Folium for Graph Plotting
- Main Algorithms - Breadth First Search, Depth First Search
- Data Structures - Heap, Queue, Lists, Graphs
Team 10 of CSC1008 as part of SIT-UofG
- Ooi Jun Kai
- Jeremy Chng
- Brendan Tan
- Sim Zhan An