Computer Science, asked by tanaithrinesh1999, 6 months ago

working of krushkal's algorithm

Answers

Answered by RajatPanwar706

1

Explanation:

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.

Answered by Anonymous

1

Explanation:

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.

Previous Question

Next Question

Similar questions

Math, 3 months ago

find the value of the following expressions when = −3. (a) 5 + 4 (b) 5² + 5 + 6 please help...

Science, 3 months ago

what is the famous place for bed sheet ? Urgent answer...

Chemistry, 3 months ago

what so you understand by atomicity?

Math, 6 months ago

answer......................................

Science, 6 months ago

applicable puind al 00. Joel c) What are the different types of coal? Write the two uses of methane. Ans: d) Define hydrocarbon. Write the properties of covalent compounds. Ans: e) Explain the difference. 1) saturated hydrocarbon and unsaturated hydrocarbon...

Chemistry, 1 year ago

the outer electronic configuration of ni3- ion is...

English, 1 year ago

With the onset of monsoons, mosquitoes have also arrived. As Ajay Arora of class XII, write an article for the school bulletin about the mosquito menace and the ways to get rid of it in not more than 200 words. NO SPAM...

English, 1 year ago

What did the big drop s of rain began fall...