The process of full arrangement can be regarded as a tree traversal process. Each leaf node is an arrangement. However, it should be noted that the edges of each subtree cannot overlap with the edges of the parent node. The tree traversal process is easy to handle, either recursively, using a stack or queue, or even setting up an array to save the state. The problem that the edges of the subtree cannot overlap with the edges of the parent node is also easy to handle. When traversing the subtree, only traverse available , and just mark it after traversing it. I think this problem is easier to solve if it is converted into a tree. It can be implemented in various ways.
![[Web front-end] Node.js quick start](https://img.php.cn/upload/course/000/000/067/662b5d34ba7c0227.png)
The process of full arrangement can be regarded as a tree traversal process. Each leaf node is an arrangement. However, it should be noted that the edges of each subtree cannot overlap with the edges of the parent node.
The tree traversal process is easy to handle, either recursively, using a stack or queue, or even setting up an array to save the state. The problem that the edges of the subtree cannot overlap with the edges of the parent node is also easy to handle. When traversing the subtree, only traverse available , and just mark it after traversing it.
I think this problem is easier to solve if it is converted into a tree. It can be implemented in various ways.