search
Log In
2 votes
138 views

in Unknown Category 138 views
0
73??
0
Yes but i am getting 75.
please tell the solution.
0
Hope this clears your doubt.

1 Answer

3 votes
 
Best answer

Ans is 73. 


selected by
0
yes.

Related questions

0 votes
0 answers
1
176 views
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
asked Nov 10, 2018 in Algorithms Lakshman Patel RJIT 176 views
4 votes
1 answer
2
1.3k views
1) Kruskal Algorithm 2) Prims Algorithm 3) Dijkstra Algorithm 4) Bellman Ford Algorithm 5) Floyd Warshall Algorithm Among these which one works for only i) Positive edge weight ii) Negative edge weight iii) Negative weight cycle
asked Apr 30, 2018 in Algorithms srestha 1.3k views
1 vote
0 answers
3
350 views
Given a graph with positive and distinct edge weights. If I double or triple.. the edge weights then:- 1. Shortest path will remain same 2. Mst will remain same Right? Note : Here i am doubling or tripling or four times ..... not increasing by +c
asked Feb 19, 2018 in Algorithms Na462 350 views
2 votes
0 answers
4
239 views
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 weights by some non zero value MST will be unchanged (answer for both positive and negative ... values ) If we add or subtract all weights by some number MST will remain unchanged. (answer for both positive and negative values)
asked Dec 25, 2017 in Algorithms smsubham 239 views
...