Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
40 views7 pages

Final Project

This project aims to create an online delivery system that calculates the shortest route and estimated distance for deliveries using data structures like vectors and graphs. It uses Dijkstra's shortest path algorithm on a weighted graph to find the shortest path between locations, tracking the shortest distance and marking visited nodes. The system allows users to place and view orders and chooses the delivery route, displaying all delivery details to the consumer for a user-friendly online ordering and delivery experience.

Uploaded by

anu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
40 views7 pages

Final Project

This project aims to create an online delivery system that calculates the shortest route and estimated distance for deliveries using data structures like vectors and graphs. It uses Dijkstra's shortest path algorithm on a weighted graph to find the shortest path between locations, tracking the shortest distance and marking visited nodes. The system allows users to place and view orders and chooses the delivery route, displaying all delivery details to the consumer for a user-friendly online ordering and delivery experience.

Uploaded by

anu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

JAYPEE INSTITUTE OF

INFORMATION AND TECHNOLOGY

DATA STRUCTURES PROJECT


SUBMITTED TO : Varsha Garg, Dr.Shikha Mehta

SUBMITTED BY –
Gauri Sharma- (9921103149)
Mansi Bakshi- (9921103157)
Yukti Sharma- (9921103159)
PROJECT REPORT

TOPIC : Online Delivery System

This project aims to create a online delivery system that is


user friendly. The software is capable enough to allow the
concerned person to get the required information about the
stuff that has to be delivered along with information about
delivery. The software allows interactive, self-describing
Graphics.

It calculates shortest route, distance, and displays all this


complete detail to the consumer.

DATA STRUCTURES USED

• Vectors
• Graphs

Functions that are performed by the system:

• Calculating the shortest route – In order to deliver the


order in minimum possible time shortest route need to be
identified. This will be done using Dijkstra’s shortest
path algorithm which is based on the concept of graph.

• Calculating the estimated distance- Based on the


shortest route selected estimated distance will be
calculated.
• Displaying details to the consumer-After all the
information mentioned above is calculated the final
details will be displayed to the consumer .
Methodology
In this Online delivery system user is asked to make a choice
between several options such as: place a order ,deliver order
,to view pending orders and to choose the location of delivery.

Once the order is placed it is delivered to the user via the


shortest path from source to the destination using the concept
of graphs and Dijkstra’s shortest path algorithm.

In Dijkstra’s shortest path algorithm a undirected/directed and


weighted graphics used , a weight graph is a graph whose
edges have a "weight" or "cost". In our case the weight of an
edge represents distance.

Dijkstra's Algorithm basically starts at the node that you


choose (the source node) in our case it is fixed as node zero
which points towards the food parlour, then it finds the
shortest path between that source node and all the other nodes
in the graph.

The algorithm keeps track of the currently known shortest


distance from each node to the source node and it updates
these values in vector ‘shortest distances’ if it finds a shorter
path.
Once the algorithm has found the shortest path between the
source node and another node, that node is marked as
"visited" using a vector named ‘visited’ and added to the
path. The process continues until all the nodes in the graph
have been marked as visited . This way, we have a path that
connects the source node to all other nodes following the
shortest path possible to reach each node.
In addition to this another vector named ‘parent’ is maintained
for each node to keep the track of the path followed in order
to reach the final destination.
SNAPSHOTS

You might also like