G=(v,e) , with weight on the edges than can be only a or b (when $a
I need to find MST of the graph in O(v+e).
I think to put all the edges in array, and than scanning the array. first only check about a, and after about b. The algorithm is like Kruskal's: check about evey edge if it doesnt form a cycle. but I'm not sure that this is taking O(v+e).