The Tokyo Metro Route Finder is a project that implements Dijkstra's algorithm on a graph representation of the Tokyo metro system. The purpose of this project is to find the shortest route between two stations and provide clear instructions to users in understandable English. The front-end interface is supported by Streamlit, a Python library for creating interactive web applications.
The Tokyo metro system is represented as a graph, where each station is a node and each connection between stations is an edge. This graph representation allows efficient computation of the shortest route using Dijkstra's algorithm.
The project utilizes Dijkstra's algorithm to find the shortest path between two stations in the Tokyo metro system. Dijkstra's algorithm guarantees finding the optimal path based on the shortest distance.
The project outputs clear and concise instructions in English to guide users through the shortest route. This ensures that users, including non-native English speakers or tourists, can easily navigate the Tokyo metro system.
The front-end interface of the project is built using PyWebIO, a user-friendly library for creating web applications. The Streamlit interface provides an intuitive and interactive experience for users to input their desired start and end stations and receive instructions.
Please install python if not installed already. Open your terminal and navigate to the directory in which this repository is cloned. Then run "pip install -r requirements.txt" in your terminal. This will install all the required dependencies to run the program.
Open your terminal and navigate to the directory in which this repository is cloned. Type "python web_app.py" into your terminal and click enter. A tab should open in your browser with the metro app.