Untitled

mail@pastecode.io avatar
unknown
plain_text
7 months ago
255 B
2
Indexable
Never
print a spanning tree using priority queue where there's vertices a,b,c,d,e ,a-b costs 1,b-b costs 2,c,d costs 3,a-c costs 4 ,and all of these are connected to e which is in center ,a-e costs 5 ,b-e costs,d-e costs 1,c-e costs 2....the code to be in c++