EUVIMEDEUVIMED entdecken
Crossref

Minimum Spanning Tree Based Network Design Using Prim’s and Kruskal’s Algorithms

Sanjhai M.L

International Journal of Creative and Open Research in Engineering and Management · 02.04.2026 · 02 (03) · 1-7

DOI: 10.55041/ijcope.v2i3.228 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Creative and Open Research in Engineering and Management, online erschienen am 02.04.2026. Verfasst von Sanjhai M.L.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Efficient network design plays a critical role in modern communication systems. The primary objective of network optimization is to connect multiple nodes with minimum cost while maintaining reliable connectivity. Graph theory provides effective methods for solving such problems using Minimum Spanning Tree (MST) algorithms. A Minimum Spanning Tree connects all vertices in a graph with the minimum possible total edge weight while avoiding cycles. This paper presents a comparative analysis of two widely used MST algorithms: Prim’s Algorithm and Kruskal’s Algorithm. The algorithms are implemented using Python and evaluated based on computational complexity and performance. Mathematical formulations, algorithmic analysis, and experimental results are presented to demonstrate their effectiveness in designing optimal communication networks such as campus networks and telecommunication infrastructure. Keywords: Graph Theory, Minimum Spanning Tree, Prim’s Algorithm, Kruskal’s Algorithm, Network Optimization, Greedy Algorithms, Python

Zitieren

APA

M.L, S. (2026). Minimum Spanning Tree Based Network Design Using Prim’s and Kruskal’s Algorithms. International Journal of Creative and Open Research in Engineering and Management, 02(03), 1-7. https://doi.org/10.55041/ijcope.v2i3.228

Vancouver

M.L S. Minimum Spanning Tree Based Network Design Using Prim’s and Kruskal’s Algorithms. International Journal of Creative and Open Research in Engineering and Management. 2026;02(03):1-7. doi:10.55041/ijcope.v2i3.228

BibTeX
@article{ML2026,
  author = {M.L, Sanjhai},
  title = {Minimum Spanning Tree Based Network Design Using Prim’s and Kruskal’s Algorithms},
  journal = {International Journal of Creative and Open Research in Engineering and Management},
  year = {2026},
  volume = {02},
  number = {03},
  pages = {1--7},
  doi = {10.55041/ijcope.v2i3.228}
}
Kostenlos starten →