Expand description
DAG-based conversation branching.
A ConversationGraph is a directed acyclic graph (DAG) where each node
represents one conversation turn (a role + content pair). Edges represent
the “follows from” relationship between turns. The graph enforces the
acyclicity invariant on every ConversationGraph::add_edge call via a
depth-first reachability check.
Structs§
- Conversation
Graph - Directed acyclic graph of conversation nodes.
- Conversation
Node - A single node in the conversation DAG.
- NodeId
- Opaque node identifier.
Enums§
- Graph
Error - Errors that can be returned by graph operations.