Follow Us :

DT Q10

10Kruskal's algorithm for finding a minimum spanning tree of a weighted graph G with n vertices and m edges has the time complexity of
  • Option : D
  • Explanation :
    For krushkal’s algorithm time complexity is O (log V)
    ∵ E → edges
    ∵ V → ventices
    So O (m log n)
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *