GitHub - colbyedell/Prim_MST: This is a C++ implementation of Prim's Minimum Spanning Tree algorithm. This is a bi-directional graph implementation, so all edges are reversible. Vertices, neighbor vertices, and edge weights are inputted to create a graph, and this program will output the edges in the minimum spanning tree of that graph.

colbyedell / Prim_MST Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

This is a C++ implementation of Prim's Minimum Spanning Tree algorithm. This is a bi-directional graph implementation, so all edges are reversible. Vertices, neighbor vertices, and edge weights are inputted to create a graph, and this program will output the edges in the minimum spanning tree of that graph.