The use of the PRIM algorithm to find a minimum spanning tree. The program uses the selected database in CSV format and converts it into a graph to find the minimum spanning tree through the Prim's Algorithm. The chosen database needed to be transformable into a connected, weighted, and undirected graph to ensure error-free processing.
Although some of my repositories are in other language(s), they have an English version of the README.md (named as README(English).md), feel free to check it out.
Bio 🧬 📜
Localização / Location: Jaboatão dos Guararapes, Pernambuco, Brasil
Eu sou um estudante do curso de Sistemas de Informação no Centro de Informática da Universidade Federal de Pernambuco / I am a student of the Information Systems program at the Center for Informatics of the Federal University of Pernambuco.