answersLogoWhite

0

It's an algorithm to find the spanning tree in decision maths. The method is:

  1. list weights in ascending order from smallest weight to largest weight.
  2. then starting form the beginning of your list, tick the weights you want to use and cross out the ones which make a cycle. do this till you've reached all the nods then cross out the rest.
  3. add up the weights you used to give you the total weight of the spanning tree.
User Avatar

Wiki User

14y ago

Still curious? Ask our experts.

Chat with our AI personalities

BeauBeau
You're doing better than you think!
Chat with Beau
TaigaTaiga
Every great hero faces trials, and you—yes, YOU—are no exception!
Chat with Taiga
SteveSteve
Knowledge is a journey, you know? We'll get there.
Chat with Steve

Add your answer:

Earn +20 pts
Q: Algorithm for spanning tree using krushkal?
Write your answer...
Submit
Still have questions?
magnify glass
imp