Kruskal Algorithm: The original paper [WIP]

Intro I usually go through research paper’s of some popular Algorithms and DS, most of them goes miles above my head. But…. The paper I found today has one of the most simplistic explanation, and over-simplification of this concept in other books and resources makes it complicated. Its the Kruskal’s Algorithm to find the minimum spanning tree. Link to the paper “On the shortest spanning subtree of a Graph and the Travelling Salesman Problem” by Joseph B....

January 6, 2021 · 4 min · Arnab Sen