Provide the input node values to start the graph evaluation:

If a single input is required, it is not necessary to use the Association:

Inspect the results:

This is equivalent to:

If no input is required, the graph can be evaluated on an empty Association:

Inspect the results:

Submit an LLMGraph for partial evaluation, providing only a subset of the input nodes' values:

Bypass the node function evaluation, providing a result for the intermediate nodes:

Inspect the results:

Evaluate graph output nodes' results:

Inspect the results:

This is equivalent to:

Request all nodes' results from an LLMGraph evaluation in the "GraphResult":

Inspect the results, including input and intermediate nodes:

Request a subset of an LLMGraph node results in the "GraphResult":

Inspect the results:

Only required ancestors up to the closest known node result were lazily added to the evaluation stack and run:

Check for node function submission and return:

Check for node canceled by the "TestFunction" result:

Check for node function failure: node failure prevents children nodes submission:

Save the evaluation results when the graph computation has reached the end:

Save partial evaluation results even when the graph computation could not be completed:

Attach a handler function to each step of the task life cycle: