Kruskal's algorithm (sort)?

The problem is that the graph that's in scope in the call to kruskals is the global graph declared as a vector.

The problem is that the graph that's in scope in the call to kruskals is the global graph, declared as a vector >. So you can't use EdgeLess to sort it, because EdgeLess compares Edgeses, not paires. Might I suggest that it's needlessly confusing to have a global variable named graph that has type vector > alongside various local variables named graph that have type vector >?

If you really need all of these distinct variables, with their current scopes and current types, then you should probably rename the global variable to something that indicates that it's global.

So you are suggesting I rename graph named as a global variable.. – kay Nov 11 at 22:07.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.