https://github.com/gauravdhoot2608/taxi_aggregator_service

This Assignment Builds a basic shortest path Algorithm.
https://github.com/gauravdhoot2608/taxi_aggregator_service

algorithms data-structures dijkstra-algorithm graph java object-oriented-programming

Last synced: about 2 months ago
JSON representation

This Assignment Builds a basic shortest path Algorithm.

• Host: GitHub
• URL: https://github.com/gauravdhoot2608/taxi_aggregator_service
• Owner: GauravDhoot2608
• Created: 2023-01-24T19:26:45.000Z (almost 2 years ago)
• Default Branch: master
• Last Pushed: 2023-01-29T20:16:51.000Z (almost 2 years ago)
• Last Synced: 2024-02-11T13:28:31.890Z (11 months ago)
• Topics: algorithms, data-structures, dijkstra-algorithm, graph, java, object-oriented-programming
• Language: Java
• Homepage:
• Size: 245 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Taxi_Aggregator_Service

* Nowadays services like Ola and Uber have become very popular. These services aggregate the services of a group of drivers who offer their cars as taxis through the platform provided by the company. One feature that makes these services particularly attractive is that their apps inform you of the time it will take for the nearest taxi to reach your current location. 

* In this assignment we will investigate the software structure required to support this kind of service on the data structures aspect.

* Implemented Dijkstra’s Algorithm for calculating shortest route and Edge List to develop the map with multiple points.