Layman806-zz /
MST-Prim
C++ implementation of Prim's algorithm for growing a Minimum Spanning Tree
23/100 healthActive repository
C++No license
⑂ 1 forks◯ 1 issuesUpdated Dec 16, 2024
Loading repository data…
Loading repository data…
Parag0506 / repository
Implementation of Prim's Algorithm in C++
A transparent discovery signal based on current public GitHub metadata.
This score does not audit code, security, maintainers, documentation quality, or suitability. Verify the repository and its current documentation before adoption.
Implementation of Prim's Algorithm in C++
PROBLEM STATEMENT: You have a business with several offices; you want to lease phone lines to connect them up with each other; and the phone company charges different amounts of money to connect different pairs of cities. You want a set of lines that connects all your offices with minimum total cost. Solve the problem by suggesting appropriate data structures.
Selected from shared topics, language and repository description—not editorial ratings.
Layman806-zz /
C++ implementation of Prim's algorithm for growing a Minimum Spanning Tree
23/100 healthbalajiathreya /
Implementation of Prim's algorithm in 3 flavors - serial, pthreads and C++ AMP
29/100 healthnicolasduartesantos /
C++ implementation of Prim's Minimal Spanning Tree algorithm using a heavily modified version of GeeksForGeeks' min heap
28/100 healthDeniztpl /
Implementation of Dijkstra and Prim's algorithms in C++14.
27/100 healthDeveloped parallel implementations of Dijkstra, Kruskal, and Prim’s algorithms using OpenMP in C, achieving 20–35% performance improvement over single-core execution through multithreading, optimized computation, and CPU utilization analysis.
42/100 healthantoinethl /
Part of a project in my Advanced Data Structures & Algorithms course in C. This part is about Graph Theory: my own implementation of an Adjacency List to represent unoriented weighted graphs and my own Prim's Algorithm
27/100 health