Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.

利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。

youdao

Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.

利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。

youdao