A C++ Implementation of a Weighted Graph and Minimum Spanning Tree
I completed this project as part of an individual assignment for my Algorithms and Data Structures class. A minimum spanning tree is a subset of edges on a undirected, weighted graph whose sum of edge weights is as small as possible. One application could be calculating the cheapest network coverage for a cell carrier company, for example. My implementation for finding the minimum spanning tree uses Prim's algorithm, which closely resembles Dijkstra's algorithm for finding the shortest path. There is also a method that uses a Depth-First Search (DFS) to determine if a path exists between two nodes in the graph.