neograph::graph::Task Struct Reference

A task is a fixed-input → expected-output contract that a compiled graph should satisfy. More...

#include <evolution.h>

Public Attributes
json	expected_output
	Expected channel values after execution.
int	expected_super_steps = 0
	Expected number of super-steps.
json	input
	Input state to feed into the graph.
std::string	name
	Name of the task (for logging/reporting).
json	reference_core
	The graph definition (core topology JSON) that solves this task.

Detailed Description

A task is a fixed-input → expected-output contract that a compiled graph should satisfy.

The task is entirely offline — it does NOT call real LLMs. Nodes in the graph are expected to be deterministic stubs (like M3's PbtNoopNode) for the evaluation to be reproducible.

Definition at line 93 of file evolution.h.

Member Data Documentation

expected_output

json neograph::graph::Task::expected_output

Expected channel values after execution.

Evaluation compares each key here with the same named RunResult channel using exact JSON equality. Extra output channels, channel versions, global_version, engine metadata, and flat convenience projections are ignored.

Definition at line 106 of file evolution.h.

expected_super_steps

int neograph::graph::Task::expected_super_steps = 0

Expected number of super-steps.

Zero disables the step-cost component. Behavioral evaluation uses GraphEngine's standard 50-step safety limit.

Definition at line 109 of file evolution.h.

reference_core

json neograph::graph::Task::reference_core

The graph definition (core topology JSON) that solves this task.

This is the ground truth — mutations are relative to this or to a derivative.

Definition at line 99 of file evolution.h.

---

The documentation for this struct was generated from the following file:

• include/neograph/graph/evolution.h