GitHub

ishitagupta5/Minimum-Spanning-Tree-Prims-Algorithm

This Python project generates a Minimum Spanning Tree (MST) from a graph represented as an adjacency matrix in CSV format, using Prim's Algorithm. It logs each selected edge and the total weight of ...
GitHub

Prim's Algorithm Implementation in C

Prim-Algorithm/ ├── src/ │ ├── main.c # 메인 프로그램 및 사용자 인터페이스 │ ├── graph.c # 그래프 자료구조 구현 │ ├── prim.c # 프림 알고리즘 구현 │ ├── priority_queue.c # 우선순위 큐 (최소 힙) 구현 │ └── utils.c # 유틸리티 함수들 ├── include ...
IEEE

Simulation Research of Communication Networks Based on Prim Algorithm

Abstract: In order to improve the efficiency of the communication networks, we used the Kruskal algorithm and the Prim algorithm through algorithm comparison and analysis methods of data structure. A ...
IEEE

An efficient Minimum Spanning Tree algorithm

Abstract: Finding minimum spanning trees (MST) in various types of networks is a well-studied problem in theory and practical applications. A number of efficient algorithms have been already developed ...