maximize the number of connected components in a graph.

Правка en2, от TuHoangAnh, 2022-02-11 12:37:34

given an undirected graph, you have to remove some nodes to maximize the number of connected components.

when removing a node, you have to remove all its edges.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский TuHoangAnh 2022-02-11 12:37:34 2 Tiny change: '\n\nwhen romoving a n' -> '\n\nwhen removing a n'
en1 Английский TuHoangAnh 2022-02-11 12:33:22 220 Initial revision (published)