A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized
A constituency is divided in four regions A, B, C and D. Two candidates X & Y contested the last election from that constituency. The adjoining graph gives the break up of voting in the four regions. Study the graph and answer the following questions.
Approximately how much percent of voters did not caste their votes?