Master Kruskal’s Algorithm Zero to Hero

  1. Network Designs
  2. Error Correction
  3. Reducing data storage for sequence of amino acids in protein
  4. Water Supply Networks
  5. Bottleneck paths
Pseudocode
  1. Edges should be sorted in nondecreasing order of their weight.
  2. Smallest edge should be picked first and check whether it is making a closed loop or cycle so far. If not then add the edge else remove it.
  3. Repeat step 2 till there are (V-1) edges in the tree.
  4. Repeat these steps and at last find the sum of the edges that are involved in the formation of minimum spanning tree

STEPS

Step 1: In the given connected and undirected graph we have to sort the edges in nondecreasing order of their weight.

  1. Layout of electric cables and TV Networks
  2. LAN Connections
  3. Usage in Geographical Maps.

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store