Question

krushkal's algorithm in graph concept


​

Answer 1

Answer:

Kruskal's algorithm finds a minimum spanning forest of an undirected edge-weighted graph. If the graph is connected, it finds a minimum spanning tree. ... It is a greedy algorithm in graph theory as in each step it adds the next lowest-weight edge that will not form a cycle to the minimum spanning forest.

I hope this helps you

please Mark me as brainliest and follow me

Answer 2

Answer:

Answer in attachment..

Mark me as brainliest plzz