A simple C++ implementation of Kruskal’s algorithm for finding minimal spanning trees in networks. Though I have a previous posting that accomplishes exactly the same thing, I thought that a simple implementation would be useful, one using a straightforward Graph data structure for modelling network links and nodes, does not have a graphical user interface and does not use the Boost Graph Library, which can be complicated to use and not to everyone’s preference.
(more…)
Tag: Minimal Spanning Tree
-
Kruskal’s Algorithm in C++
-
Finding Minimal Spanning Trees using Kruskal’s Algorithm in MFC / C++ / Boost libraries
Kruskal’s algorithm is used to find the minimal spanning tree for a network with a set of weighted links. This might be a telecoms network, or the layout for planning pipes and cables, or one of many other applications. (more…)