New answers tagged

0

Clearly, the number of added edges is one less than the number of connected components in the graph, since we can decrease this number by one by adding an edge and we seek the minimum number of added edges. The trick is to add the edges between central vertices of the connected components. A central vertex of a connected component is a vertex that has ...


Top 50 recent answers are included