PRIM'S ALGORITHM
Download as PPTX, PDF0 likes1,068 views
Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. It was developed in 1930 by Czech mathematician Vojtěch Jarník but later rediscovered and published by computer scientists Robert C. Prim in 1957 and Edsger W. Dijkstra in 1959. The algorithm finds the minimum spanning tree by building it one edge at a time, each time choosing the next edge that connects an isolated vertex to a partially constructed minimum spanning tree.
PRIM'S ALGORITHM
- 1. Prim’s Algorithm By : Garishma Bhatia
- 2. Content Layout List • Minimal Spanning Tree • Prim’s Algorithm • Example • Algorithm • Analysis • Complexity • References
- 3. What is Minimum Spanning Tree? • A spanning tree is a subset of Graph G, which has all the vertices covered with minimum possible number of edges. • Hence, a spanning tree does not have cycles and it cannot be disconnected.
- 4. Prim’s Algorithm • Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. • The algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. • But later rediscovered and republished by computer scientists Robert C. Prim in 1957 and Edsger W. Dijkstra in 1959. • Therefore, it is also sometimes called the DJP algorithm, the Prim– Dijkstra algorithm
- 5. Two Content Layout with Table • First bullet point here • Second bullet point here • Third bullet point here Class Group A Group B Class 1 82 95 Class 2 76 88 Class 3 84 90
- 6. Two Content Layout with SmartArt Group A • Task 1 • Task 2 Group B • Task 1 • Task 2 Group C • Task 1 • First bullet point here • Second bullet point here • Third bullet point here
- 7. Add a Slide Title - 1
- 8. Add a Slide Title - 2
- 9. Add a Slide Title - 3
- 11. Add a Slide Title - 4
- 12. Add a Slide Title - 5