Prim’s algorithm is also a Greedy algorithm. It starts with an empty Spanning Tree. The idea is to maintain two sets of vertices. The first set contains the vertices already included in the MST, the ...

Tarefas para o aprendizado de algoritmos, da cadeira Algoritmo e Estrutura de Dados do curso de Sistemas de Informação (SI) do CIn da UFPE, cadeira cursada por mim em 2023.

Abstract: This research paper offers a comprehensive study of minimum spanning tree (MST) algorithms, mainly focusing on Prims and Kruskals approaches. MST problems holds a fundamental role in ...