KRUSKAL’S ALGORITHM (SUMMARY)

  1. We need to sort all of the edges from low to high fashion.
  2. Then we need to opt. for the edge which has the most minimal weight and then adds that to the spanning tree following this step if we encounter a situation where it forms a cycle then we need to reject that edge and move to the next minimal edge.
  3. we need to continue the #2 step till there are (v-1) vertices in the spanning tree.
GRAPH

--

--

--

«PRANJAY؄ꌗเńɢн GULERIA_2002» ....«18» (#rajputboy👑).... ....«😘@mahi7781😘».... ...«Wish me on 19 August». 🍰.. ...«Animal and music lover»...

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Can you solve this? Question 2. Questions my students have posed.

Creating Lottery Combinations Based On Dreams

Fuzzy logic Part 1 — (the μ parameter)

How Do You Win Chess In Game Pigeon

Human Right That Could Result In Cheeps

Human Right That Could Result In Cheeps

When is a prime equal to x²+y²?

Plotting Free-Hand Curves

The plot of a function with a green belt of “radius” 1.

Tik Tok of: Debunking the Viral Talking Dog USA

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
Pranjayguleria

Pranjayguleria

«PRANJAY؄ꌗเńɢн GULERIA_2002» ....«18» (#rajputboy👑).... ....«😘@mahi7781😘».... ...«Wish me on 19 August». 🍰.. ...«Animal and music lover»...

More from Medium

A Gentle Introduction to Big-Oh Notation Through Sorting Algorithms

Next Generation Cloud Computing Audit Guidelines — CSA CCM v4.0

CCM-01

The FTC takes steps to regulate AI abuses — but will it be effective?

3–2–1 Primitive, Together,