Bus route finder

OOPS ADS SEM-4-Project

A mini project that utilizes Dijkstra's shortest path algorithm to suggest a suitable bus or sequence of buses to the users to travel from source city to destination city. The inputs including graph and bus details are persisted using files.

Documentation: https://docs.google.com/document/d/1tzm89_7C8mtwawNPZ9WHibV5QA-R13avFg7zlQINmG8/edit?usp=sharing

Data Structure(s) used:

Weighted Undirected Graph

Unordered_map

File handling (Txt Files)

Arrays(1D & 2D)

User defined Modules:

a. Bus class:

Void init_citynames() --Reads from cities(vertices) file and initializes the hash map

Void init_bus_no() --Reads from bus file and initialized bus hash map

Void show() --Shows the details of a particular bus

b. Graph class

Void addEdge() --Adding a new bus(Edge) to file and graph

printGraph() --Reads file from graph and shows the adjacency matrix

shortestRoute() --Shows which bus/ buses to take to read from City A to City B.

c. get_and_store_bus.cpp 

void addbus() --Adds a bus corresponding to given edge to the list of buses

void show() --Reads all bus objects from file and displays their details

void initGraph() --Initializes graph object

d. main.cpp 

void logo() --Displays logo of the project

Made by:

Harishankar H

Hritik viknesh

Arvind P