Register

Minimum spanning tree implementation in other way
closed

• closed by
943 views
0 0 votes
closed as a duplicate of: Cormen Edition 3 Exercise 23.2 Question 6 (Page No. 637)
Which algorithm will be implemented on the weighted graph in which the edges are uniformly distributed over the half-open interval $[0,1)$ to construct MST so that it runs in linear time?
$A)$ Kruskal's algorithm                              $B)$ Prim's algorithm
$C)$ Both $(A)$ and $(B)$                                $D)$ None of these
Voting & Accepting an answer helps improve the community
← Previous · Preparation adviceNext → · self soubt
← Previous in category · please explain also....Next in category → · How to solve this:
Position:
Show:

Related questions

4 4 votes
1 answers 1 answer
4.9k
4.9k views
srestha asked Apr 30, 2018
4,851 views
Minimum Spanning Tree
1) Kruskal Algorithm2) Prims Algorithm3) Dijkstra Algorithm4) Bellman Ford Algorithm5) Floyd Warshall AlgorithmAmong these which one works for onlyi) Positive edge weight...
1 1 vote
0 0 answers
889
889 views
Na462 asked Feb 19, 2018
889 views
Minimum Spanning Tree Problem
Given a graph with positive and distinct edge weights. If I double or triple.. the edge weights then:- 1. Shortest path will remain same2. Mst will remain sameRight?Note ...
2 2 votes
0 0 answers
1.1k
1.1k views
smsubham asked Dec 25, 2017
1,073 views
Minimum Spanning Tree
Which of the following are correct for Minimum Spanning Tree from graph G with unique weights, with the weight function w: E→R (more than one possible)If we divide all we...
2 2 votes
0 0 answers
678
678 views
Dulqar asked Jan 26, 2017
678 views
Minimum Spanning Tree
Show the different minimum spanning Trees Possible in each of the following AlgorithmsPrims AlgorithmKruskal