Understanding Minimal Spanning Trees: An Overview of Kruskal's and Prim's Algorithms

Minimal Spanning Trees (MST) | Kruskal's and Prim's Algorithms

Individual Project Output
Submitted by Genellie Ester T. Erap (EM1)
In compliance with the requirements of GEMATMW

References:
Greedy Algorithms. (n.d.). Retrieved December 11, 2020, from https://brilliant.org/wiki/greedy-algorithm/
Nocon, R.& Nocon, E. (2018). Chapter 5: Efficiency. In Mathematics in the Modern World (pp. 259-360). C&E Publishing
Patel, N., & Patel, K. M. (2015). A Survey on: Enhancement of Minimum Spanning Tree. In Journal of Engineering Research and Applications www.ijera.com (Vol. 5, Issue 1). www.ijera.com

Image References:
https://tdg2018.files.wordpress.com/2018/04/kruskal_joseph.jpeg?w=1100
https://www.ithistory.org/sites/default/files/honor-roll/Robert%20Clay%20Prim.jpg

Music Credits:

► Lakey Inspired
https://soundcloud.com/lakeyinspired
https://www.youtube.com/c/LakeyInspir...
https://www.instagram.com/lakeyinspired/


► Free Music Download Channel
• https://www.youtube.com/channel/UC_l5...