Question

explain Kruskals algorithm on tree with an example​

Answer 1

❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎

Ⓐ︎Ⓝ︎Ⓢ︎Ⓦ︎Ⓔ︎Ⓡ︎

❀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

❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎❄︎