Kruskal’s algorithm is best suited for which type of graphs?
a) Dense graphs
b) Sparse graphs
c) Directed graphs only
d) Graphs with negative weights
Welcome!
This community is for professionals and enthusiasts of our products and services.
Share and discuss the best content and new marketing ideas, build your professional profile and become a better marketer together.
This question has been flagged
87
Views
