* Updates the graph execution order according to relevance of the nodes (nodes with only outputs have more relevance than * nodes with only inputs.
()
| 520 | * nodes with only inputs. |
| 521 | */ |
| 522 | updateExecutionOrder(): void { |
| 523 | this._nodes_in_order = this.computeExecutionOrder(false) |
| 524 | this._nodes_executable = [] |
| 525 | for (const node of this._nodes_in_order) { |
| 526 | if (node.onExecute) { |
| 527 | this._nodes_executable.push(node) |
| 528 | } |
| 529 | } |
| 530 | } |
| 531 | |
| 532 | // This is more internal, it computes the executable nodes in order and returns it |
| 533 | computeExecutionOrder( |
no test coverage detected