Does kruskal algorithm work for directed graphs
Answers
Answered by
1
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.
Similar questions