Make sure that the set of vertices satisfying a certain condition of a graph is always a [connection
m_solutions2019D x pieces selected from the larger ones are connected
Conversely, fill in the blanks (at the end of a task).
This page is auto-translated from /nishio/飛地をつくらない using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I’m very happy to spread my thought to non-Japanese readers.