This document discusses greedy algorithms for minimum spanning trees and shortest paths. It describes Prim's and Kruskal's algorithms for finding minimum spanning trees in graphs, noting Kruskal's runs in O(|E| log |E|) time with an efficient sorting algorithm. It also mentions Dijkstra's algorithm for finding shortest paths in graphs with non-negative edge weights.

1. Greedy Algorithms
Created by
Dr. Soham Sarkar
ECE dept., RCCIIT

13. Minimum Spanning Tree

14. Prim’s Algorithm

18. Kruskal’s Algorithm

21. Hence, with an efficient sorting algorithm, the time efficiency of Kruskal’s
algorithm will be in O(|E| log |E|).

26. Dijkstra’s Algorithm
This algorithm is applicable to undirected and directed graphs with nonnegative
weights only