MCPcopy Create free account
hub / github.com/celery/celery / visit

Method visit

celery/utils/graph.py:140–157  ·  view source on GitHub ↗
(node)

Source from the content-addressed store, hash-verified

138 result, stack, low = [], [], {}
139
140 def visit(node):
141 if node in low:
142 return
143 num = len(low)
144 low[node] = num
145 stack_pos = len(stack)
146 stack.append(node)
147
148 for successor in self[node]:
149 visit(successor)
150 low[node] = min(low[node], low[successor])
151
152 if num == low[node]:
153 component = tuple(stack[stack_pos:])
154 stack[stack_pos:] = []
155 result.append(component)
156 for item in component:
157 low[item] = len(self)
158
159 for node in self:
160 visit(node)

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected