Adventures of Union Find
Hello folks 👋 Glad to see you reading this article again! Today we’re gonna talk about problems in graphs. Let’s take a look at the problem below. Imagine we have an edge-weighted undirected graph consisting of a few nodes. Our target is to find a minimum spanning tree in this graph. Minimum spanning tree is an undirected subgraph that contains all the vertices without cycles and with a minimum edges weight....