2 votes 2 votes Algorithms shortest-path graph-algorithms minimum-spanning-tree + – yes asked Oct 13, 2015 retagged Dec 3, 2015 by Pooja Palod yes 4.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes 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 Rohan Ghosh answered Oct 13, 2015 Rohan Ghosh comment Share Follow See 1 comment See all 1 1 comment reply yes commented Oct 13, 2015 reply Follow Share yaa u r right nothing big concept in this ... 0 votes 0 votes Please log in or register to add a comment.