General purpose of this lecture is to Presentation on Algorithms, here focus on Single-Source Shortest Path. This lecture briefly explain on Prim’s Algorithm in Single-Source Shortest Path and Bellman-Ford Algorithm in DAG Shortest Paths. Here also explain Dijkstra’s Algorithm and Kruskal’s Algorithmwith examples and graph. Finally briefly discuss on Amortized Analysis of Disjoint Sets, here thhe major analysis is Amortized analysis computes average times without using probability.
Presentation on Algorithms
