in Algorithms retagged by
4,030 views
2 votes
2 votes

in Algorithms retagged by
by
4.0k views

1 Answer

5 votes
5 votes
Best answer

The concept of MST allows weights of an arbitrary sign. The two most popular algorithms for finding MST (Kruskal's and Prim's) work fine with negative edges.

Actually, you can just add a big positive constant to all the edges of your graph, making all the edges positive. The MST (as a subset of edges) will remain the same.-ref:http://stackoverflow.com/questions/10414043/is-minimum-spanning-tree-afraid-of-negative-weights

1 comment

yaa u r right nothing big concept in this ...
0
0

Related questions