需求是這樣的，有很多類似的流程如下：
有一個函數(shù)，我傳入一個開始節(jié)點Node，能夠獲取所有的流程走向，包裝List返回，比如上面這張圖就有兩種走向：通過和不通過。我開始用遞歸來做，類似這樣：
測試了幾個流程，確實能達到效果，但是一遇到復雜的流程（上百種走向）的時候，
遞歸就會有性能問題（棧溢出等）
請問各位大神，像這種情況除了遞歸還有什么解法嗎？如果沒有，這種遞歸有哪里可以優(yōu)化的地方？小弟能力有限，想了幾天沒啥好辦法....
2
0
0
歡迎選擇我的課程，讓我們一起見證您的進步~~
The problem is recursive, and recursion is not necessary for implementation. You can put "Node that has not yet been searched" into a List. Each time a new Node is found, it is placed at the end of the List. When the next round of search starts, it is taken from the end of the List.
Dynamic programming should also be used to reduce repeated searches. This problem is NP in complete search.
![[Web front-end] Node.js quick start](https://img.php.cn/upload/course/000/000/067/662b5d34ba7c0227.png)
