|
NeoGraph 0.16.0
A C++20 Graph Agent Engine Library — LangGraph for C++
|
One task vertex in a finite TaskGraphProposal DAG. More...
#include <task_graph_proposal.h>
Public Attributes | |
| std::vector< TaskGraphInputLiteral > | literals |
| Schema 2; sorted by target field. | |
| std::uint32_t | max_attempts = 1 |
| Schema 2: attempts the task may take, 1 to TaskGraphProposalLimits::max_attempts. | |
One task vertex in a finite TaskGraphProposal DAG.
Definition at line 138 of file task_graph_proposal.h.
| std::uint32_t neograph::program::TaskGraphTask::max_attempts = 1 |
Schema 2: attempts the task may take, 1 to TaskGraphProposalLimits::max_attempts.
Each attempt has the whole budget, so the aggregate counts it once per attempt.
Definition at line 148 of file task_graph_proposal.h.