English, asked by umadevinayagam, 3 months ago

Explain Kruskal Algorithm with example.​

Answers

Answered by Dipu6256
2

Answer:

Kruskal's Algorithm is a famous greedy algorithm. It is used for finding the Minimum Spanning Tree (MST) of a given graph. To apply Kruskal's algorithm, the given graph must be weighted, connected and undirected.

Answered by Aleeza29
0

Answer:

u can search on google

or on.youtube

Previous Question
Next Question
Similar questions
Computer Science, 1 month ago
which of the following operations can be performed on a query Option: a) Sort of query b) Delete the query c) None​...
History, 1 month ago
parallel government was formed by. in satara​...
Physics, 1 month ago
(i) A planet moves around the sun in nearly circular orbit. Its period of revolution T depends upon : (a) radius ‘r’ of orbit (b) mass ‘M’ of the sun & (c) the gravitational constant G. Show dimensionally that T2 α r 3 . Taking the proportionality constant as 2π , write the expression for T​...
Hindi, 3 months ago
kar chale ham Fida path ka sandesh aur uddesh bataiye​...
English, 3 months ago
Put side by side mean​...
Math, 8 months ago
A largest possible sphere had been carved from a cubical wooden blocks of edge 42cm. Find the volume of the carved out wood.
Physics, 8 months ago
write equation for magnetic field due to short bar magnet (a)along axis (b) along equator. what is realtion between them ​...
Science, 8 months ago
what is the difference between greenhouse effect and global warming also tell what is the relation between greenhouse effect and global warming ​...