683 views

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
0 0 answers
966
966 views
Lakshman Bhaiya asked Nov 10, 2018
966 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 run...
4 4 votes
1 answers 1 answer
4.9k
4.9k views
srestha asked Apr 30, 2018
4,949 views
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
901
901 views
Na462 asked Feb 19, 2018
901 views
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,085 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 we...