Mirrored_Repos/InvokeAI
1
0
Fork 0
mirror of https://github.com/invoke-ai/InvokeAI synced 2024-08-30 20:32:17 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix(nodes): use DFS with preorder traversal

Browse Source
This commit is contained in:
psychedelicious 2023-06-09 12:09:52 +10:00
parent 9c57b18008
commit c91b071c47
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
invokeai/app/services/graph.py
View File

@ -1131,13 +1131,13 @@ class GraphExecutionState(BaseModel):
"""Gets the deepest node that is ready to be executed""" """Gets the deepest node that is ready to be executed"""
g = self.execution_graph.nx_graph() g = self.execution_graph.nx_graph()
# we need to traverse the graph in from bottom up # Depth-first search with pre-order traversal is a depth-first topological sort
reversed_sorted_nodes = reversed(list(nx.topological_sort(g))) sorted_nodes = nx.dfs_preorder_nodes(g)
next_node = next( next_node = next(
( (
n n
for n in reversed_sorted_nodes for n in sorted_nodes
if n not in self.executed # the node must not already be executed... if n not in self.executed # the node must not already be executed...
and all((e[0] in self.executed for e in g.in_edges(n))) # ...and all its inputs must be executed and all((e[0] in self.executed for e in g.in_edges(n))) # ...and all its inputs must be executed
), ),