This presentation discusses algorithms for finding the shortest path between vertices in a graph. It introduces Dijkstra's algorithm, a greedy approach that can find the shortest path from a single source node to all other nodes in a weighted, connected graph. The algorithm works for both directed and undirected graphs, and examples are provided to demonstrate how it can be applied to find the lowest cost path between nodes.

1. WELCOME TO MY
PRESENTATION

2. SHORTEST
PATH
Md. Harun Or Rashid
ID: 193-15-2966
Section: PC A

3. Shortest path algorithm
• An algorithm that is designed essentially to
find of minimum length between two
specified vertices of a connected weighted
graph.

4. Dijkstra’s algorithm
• Dijkstra's algorithm is a greedy algorithm for
solving single source shortest path problem that
provide us with the shortest path from one
particular source node to all other nodes in the
given graph.

5. Rules of Dijkstra's algorithm
• It can be applied on both directed an undirected
graph.
• It is applied on weighted graph.
• For the algorithm to be applicable the graph must be
connected.
• Delete all parallel edges with higher cost.

6. Dijkstra’s algorithm example:

7. Dijkstra’s algorithm example:

8. Dijkstra’s algorithm example:

9. Dijkstra’s algorithm example
Result:
Nodes visited order: a->f->b->c->e->d
Solution path: a->f->b->c->e->d
Solution cost:13