Topological Sort - Longest Path With Different Adjacent Characters
The following code attempts to find the longest path with different adjacent characters in a DAG. Identify the subtle bug that causes incorrect results on some inputs.
```python
from collections import defaultdict, deque
def longest_path_buggy(n, edges, s):
graph = defaultdict(list)
indegree = [0] * n
for u, v in edges:
graph[u].append(v)
indegree[v] += 1
queue = deque([i for i in range(n) if indegree[i] == 0])
topo_order = []
while queue:
node = queue.popleft()
topo_order.append(node)
for nei in graph[node]:
indegree[nei] -= 1
if indegree[nei] == 0:
queue.append(nei)
dp = [1] * n
for node in topo_order:
for nei in graph[node]:
dp[nei] = max(dp[nei], dp[node] + 1) # BUG: missing character check
return max(dp)
```
