CS 511 Project Guidelines Project Presentation 100% Presentation Outline 7 - 10 Slides · Introduction · Problem Definition · Applications of (Algorithm Assigned) · Real Life Use cases · Solution...

Dijkstra’s Algorithm
Dijkstra’s Algorithm
Submitted By:-
Introduction
In this presentation we will talk about the problems which are faced which we are trying to compute the path in the graphs.
The graphs can be directed or undirected. With the undirected graph it becomes very difficult to find the shortest path to reach from one point to another. We will discuss about the Dijkstra’s algorithm and how it is able to solve the problem. Dijkstra’s algorithm is also known as the shortest path algorithm. It is an algorithm used to find the shortest path between nodes of the graph
2
In this presentation we will talk about the problems which are faced which we are trying to compute the path in the graphs.
The graphs can be directed or undirected.
With the undirected graph it becomes very difficult to find the shortest path to reach from one point to another.
We will discuss about the Dijkstra’s algorithm and how it is able to solve the problem.
Problem Definition
The graph is a non-linear data structure that involves nodes and edges. The nodes are the vertices and edges are the lines that connect the two nodes in the graph. Therefore, the graph can be defined as a set of vertices and a set of edges that connect the nodes.
We need an algorithm which can be utilized to find the smallest path of graph.
t is an algorithm used to find the shortest path between nodes of the graph. The algorithm creates the tree of the shortest paths from the starting source vertex from all other points in the graph.
3
The graph can be defined as the nonlinear data structure which has nodes and edges.
The nodes can be vertices and edges are actually the lines which are responsible for connecting two nodes of graphs.
Graph can be defined as set of edges and nodes.
We need an algorithm which can be utilized to find the smallest path of graph.
This algorithm should be able to find the shortest path between the nodes of the graph.
It is expected that this algorithm will be able to create tree for the shortest path from the source vertex.
Real life use cases
Dijkstra’s algorithm is widely used in the routing protocols required by the routers to update their forwarding table. The algorithm provides the shortest cost path from the source router to other routers in the network.
1) It is used in Google Maps
2) It is used in finding Shortest Path.
3) It is used in geographical Maps
4) To find locations of Map which refers to vertices of graph.
5) Distance between the location refers to edges.
6) It is used in IP routing to find Open shortest Path First.
7) It is used in the telephone network.
4
This algorithm can be used in the routing protocols which are necessary for the routers so that they can update the forwarding table.
It provides the shortest cost path from source router to other routers present in network.
Can be used in google maps and in geographical maps for finding shortest path.
To find the location of map as they can be considered as the vertices of graphs.
Find the distance between location which can be edges.
It is also used...