Given an undirected graph. How do I check if it can be divided into two sets where every node of one set is connected to every other node of its own set ...
確定! 回上一頁