Computer Science, asked by mdazfaralmtupam4914, 1 year ago

Does kruskal algorithm work for directed graphs

Answers

Answered by TempoRise

No, Prim's and Kruskal's algorithm works only for undirected graphs. For directed graphs, the equivalent notion of a spanning tree is spanning arborescence. A minimum weight spanning arborescence can be found using Edmonds' algorithm.

Previous Question

Next Question

Similar questions

Psychology, 8 months ago

Find the missing term in the given series:- a) 10, 19, 40, 77, 158...... 1)311 2)307 3)301 4)299...

Math, 8 months ago

why do we need to study statistics in nursing...

Math, 8 months ago

24) In a seminar the number of participants in Hindi, English and Mathematics are 60,84 and 108 respectively. Find the minimum number of rooms required if in each room the same number of participants are to be seated and all of them being in the same subject.

Biology, 1 year ago

Due to what reason periods get irregular...

Computer Science, 1 year ago

Does kruskal algorithm work with negative weights...

Accountancy, 1 year ago

Opening Stock= 22,000Closing Stock= 25,000Purchase return= 11,000Gross Profit on sales= 20%then Sales=?With full explanation plz.

Social Sciences, 1 year ago

Explain the distribution of minerals in India?

History, 1 year ago

What is the meaning of Segregation?