Skip to content

Implementation of a route-guider system using different data structures in Java

Notifications You must be signed in to change notification settings

neharathod26/route-guider-system

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

route-guider-system

Implementation of a route-guider system using different data structures in Java

This is a group project for the course Data Structures and Algorithms 2 Laboratory (CE 2201).
Aim of the project is to develop an online route guider system for customers to find the shortest distance between cities.
Programming language used: Java
Data Structures used: Graph,ArrayList
Algorithms used: Dijkstra's Shortest path algorithm

Overview of Project


-A user can find the shortest distance along the cities which he is willing to travel.
-User can also Search same type of places in a city.
-Admin can add new cities to existing graph.
-Like wise admin can add new places / locations in a particular city.

About

Implementation of a route-guider system using different data structures in Java

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages