Hindi, asked by sabrakhatoon99555, 5 months ago

kar chale ham Fida path ka sandesh aur uddesh bataiye​

Answers

Answered by Dipu6256
3

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.

Similar questions