深入解析图遍历双雄：BFS与DFS的工程哲学与React Fiber的架构启示

1A → B → D → H → I → E → C → F → G

1def dfs_iterative(root):
2    stack = [root]
3    while stack:
4        node = stack.pop()
5        process(node)
6        # 注意压栈顺序的逆向处理
7        for child in reversed(node.children):
8            stack.append(child)

1A → B → C → D → E → F → G → H → I

1from collections import deque
2
3def bfs(root):
4    queue = deque([root])
5    visited = set()
6    while queue:
7        node = queue.popleft()
8        process(node)
9        for neighbor in node.neighbors:
10            if neighbor not in visited:
11                visited.add(neighbor)
12                queue.append(neighbor)

1def ladderLength(beginWord, endWord, wordList):
2    wordSet = set(wordList)
3    queue = deque([(beginWord, 1)])
4    while queue:
5        word, length = queue.popleft()
6        if word == endWord:
7            return length
8        for i in range(len(word)):
9            for c in 'abcdefghijklmnopqrstuvwxyz':
10                next_word = word[:i] + c + word[i+1:]
11                if next_word in wordSet:
12                    wordSet.remove(next_word)
13                    queue.append((next_word, length+1))
14    return 0

1def solveNQueens(n):
2    def backtrack(row, cols, diag1, diag2):
3        if row == n:
4            res.append(["".join(r) for r in board])
5            return
6        for col in range(n):
7            d1 = row - col
8            d2 = row + col
9            if col in cols or d1 in diag1 or d2 in diag2:
10                continue
11            board[row][col] = 'Q'
12            backtrack(row+1, cols|{col}, diag1|{d1}, diag2|{d2})
13            board[row][col] = '.'
14    
15    res = []
16    board = [['.']*n for _ in range(n)]
17    backtrack(0, set(), set(), set())
18    return res

1App Fiber
2├── child: Header Fiber
3│       └── child: Logo Fiber
4│               └── sibling: Nav Fiber
5├── sibling: Main Fiber
6└── return: Root Fiber

1function workLoop(deadline) {
2  while (nextUnitOfWork && deadline.timeRemaining() > 0) {
3    nextUnitOfWork = performUnitOfWork(nextUnitOfWork);
4  }
5  if (!nextUnitOfWork) {
6    commitRoot();
7  } else {
8    requestIdleCallback(workLoop);
9  }
10}