Skip to content

Tag Archives: Kruskal

Below are the steps for finding MST using Kruskal’s algorithm   1. Sort all the edges in non-decreasing order of their weight. 2. Pick the smallest edge.… Read More
What is a Spanning Tree? A Spanning tree is a subset to a connected graph G, where all the edges are connected, i.e, we can… Read More

Start Your Coding Journey Now!