The document outlines the development of a road guide software designed to help users find the shortest path to their destinations. It emphasizes the need for user-friendly, flexible, and fast navigation, while detailing features such as offline capability and reduced travel time. The tool utilizes Dijkstra's algorithm for calculating the shortest path but has limitations like the inability to automatically detect user location.

2. ROAD GUIDE

3. This is one kind of map system. It will help the
users to find the shortest path to reach their goal.
Introduction

4. Motivation
Time is valuable. No one wants to waste his or
her time when he or she is moving from one place
to another. So they look for the shortest path that
will take them to their goal. But at present there
is no system that can directly help anyone to find
the shortest path. Hence, a system is required
that can perform as a shortest path finder.
Moreover, the system should be user friendly,
flexible and fast.

5. ABOUT
The purpose of developing this software project is
to help the users to find the shortest path. This
software is capable of showing the shortest path
distance and direction that is very helpful for the
users. On the basis of certain formulas it will
generate shortest path distance and direction as
output. All the data such as place name, distance
be stored in database as a track record.

6. Reliability issues
Geodata is expensive

7. Bandwidth issues
Privacy issues

8. Features and Benefits
1)Shows the shortest path directly.
2)Takes less time.
3)Easy to operate.
4)Can be used in offline.
5)Saving Money .
User friendly, flexible, fast.

9. Limitations
1)Unable to detect user’s location
automatically.
2)User has to know where he or she is.
3) Unable to show image of road map.

10. Tools
1)Code blocks.
2)C++.
3) Dijkstra’s Algorithm

11. Dijkstra’s Introduction
Dijkstra's algorithm - is a solution to the
single-source shortest path problem in
graph theory.
Works on both directed and undirected
graphs. However, all edges must have
nonnegative wights.

12. This algorithm finds the path with lowest cost
between that vertex and every other vertex.
According to this algorithm to solve a given
problem we need to solve different part of
problems.
How It Works

13. Basic Example

14. Real Life Example

15. Working Operation

16. Working Operation

17. Working Operation

18. Working Operation