1.

Consider a directed graph with n vertices and m edges such that all edges have same edge weights. Find the complexity of the best known algorithm to compute the minimum spanning tree of the graph?(A) O(m+n)(B) O(m logn)(C) O(mn)(D) O(n logm)

Answer»


Discussion

No Comment Found

Related InterviewSolutions