EUVIMEDEUVIMED entdecken
Crossref

Prim's Algorithm for Obtaining Minimum Spanning Trees in Weighted Graphs

Bagner Diaz-Rodriguez, Ruth Gonzales-Mondragon, Alessandro Pérez-Gonzalez, Elmer Ramírez-Quispe, Marco Sánchez-Sangama

TechNoLogica · 26.06.2026 · 1 (2) · 8-14

DOI: 10.17268/tech1.2.2026.02 ↗

Kurz gefasst

Fachartikel in der Zeitschrift TechNoLogica, online erschienen am 26.06.2026. Verfasst von Bagner Diaz-Rodriguez und 4 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Greedy algorithms constitute one of the most widely used algorithmic strategies for solving optimization problems in computer science. Among them, Prim’s algorithm stands out for its ability to construct minimum spanning trees in connected weighted graphs. The objective of this research is to analyze the operation, application, and efficiency of Prim’s algorithm within the context of algorithmic strategies. The methodology consisted of a bibliographic review of specialized literature and the analysis of practical examples applied to weighted graphs. Preliminary results show that the algorithm obtains optimal solutions through the iterative selection of minimum -cost edges, guaranteeing the connection of all vertices without generating cycles. Furthermore, its importance is evident in problems related to network design, telecommunications, and transportation systems. It is concluded that Prim’s algorithm represents an efficient alternative for constructing minimum spanning trees, especially in dense graphs where cost minimization is essential.

Zitieren

APA

Diaz-Rodriguez, B., Gonzales-Mondragon, R., Pérez-Gonzalez, A., Ramírez-Quispe, E., & Sánchez-Sangama, M. (2026). Prim's Algorithm for Obtaining Minimum Spanning Trees in Weighted Graphs. TechNoLogica, 1(2), 8-14. https://doi.org/10.17268/tech1.2.2026.02

Vancouver

Diaz-Rodriguez B, Gonzales-Mondragon R, Pérez-Gonzalez A, Ramírez-Quispe E, Sánchez-Sangama M. Prim's Algorithm for Obtaining Minimum Spanning Trees in Weighted Graphs. TechNoLogica. 2026;1(2):8-14. doi:10.17268/tech1.2.2026.02

BibTeX
@article{DiazRodriguez2026,
  author = {Diaz-Rodriguez, Bagner and Gonzales-Mondragon, Ruth and Pérez-Gonzalez, Alessandro and Ramírez-Quispe, Elmer and Sánchez-Sangama, Marco},
  title = {Prim's Algorithm for Obtaining Minimum Spanning Trees in Weighted Graphs},
  journal = {TechNoLogica},
  year = {2026},
  volume = {1},
  number = {2},
  pages = {8--14},
  doi = {10.17268/tech1.2.2026.02}
}
Kostenlos starten →