Struct TrajectoryGraph 

pub struct TrajectoryGraph { /* private fields */ }

Trajectory DAG structure optimized for traversal operations.

A trajectory represents a sequence of experiences (episodes) forming a path through time. The DAG structure captures branching and regeneration points.

Implementations

impl TrajectoryGraph

pub fn new() -> Self

Create a new empty graph.

pub fn from_edges(edges: impl IntoIterator<Item = Edge>) -> Self

Build graph from a list of edges.

Arguments

• edges - Iterator of (parent_id, child_id) pairs

Example

use rag_plusplus_core::trajectory::{TrajectoryGraph, Edge, EdgeType};

let edges = vec![
    Edge { parent: 1, child: 2, edge_type: EdgeType::Continuation },
    Edge { parent: 2, child: 3, edge_type: EdgeType::Continuation },
    Edge { parent: 2, child: 4, edge_type: EdgeType::Regeneration }, // Branch
];

let graph = TrajectoryGraph::from_edges(edges.iter().copied());
assert_eq!(graph.node_count(), 4);
assert!(graph.is_branch_point(2));

pub fn add_node(&mut self, node: Episode)

Add a single episode.

pub fn get_node(&self, id: NodeId) -> Option<&Episode>

Get an episode by ID.

pub fn get_node_mut(&mut self, id: NodeId) -> Option<&mut Episode>

Get a mutable reference to an episode.

pub fn node_count(&self) -> usize

Number of episodes in the graph.

pub fn roots(&self) -> &[NodeId]

Get all root episodes (episodes without parents).

pub fn leaves(&self) -> &[NodeId]

Get all leaf episodes (episodes without children).

pub fn is_branch_point(&self, id: NodeId) -> bool

Check if an episode is a branch point.

pub fn find_branch_points(&self) -> Vec<BranchInfo>

Find all branch points in the graph.

pub fn traverse<F>(&self, order: TraversalOrder, visitor: F)

where F: FnMut(&Episode),

Traverse the graph in specified order, calling visitor for each episode.

Arguments

• order - Traversal order
• visitor - Callback function for each episode

pub fn find_primary_path( &self, policy: PathSelectionPolicy, ) -> Option<PathResult>

Find the primary path through the DAG using the specified selection policy.

The primary path is a linear sequence from a root to a leaf that represents the “best” version of the trajectory (e.g., after regenerations).

Arguments

• policy - How to choose at branch points

Returns

PathResult containing the selected path and branch information.

pub fn find_all_paths_from(&self, start: NodeId) -> Vec<Vec<NodeId>>

Find all paths from an episode to all reachable leaves.

pub fn find_path_to(&self, target: NodeId) -> Option<Vec<NodeId>>

Find the path from root to a specific episode.

pub fn depth(&self, node: NodeId) -> Option<usize>

Compute the depth of an episode (distance from root).

pub fn lowest_common_ancestor(&self, a: NodeId, b: NodeId) -> Option<NodeId>

Find the lowest common ancestor of two episodes.

Trait Implementations

impl Clone for TrajectoryGraph

fn clone(&self) -> TrajectoryGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TrajectoryGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for TrajectoryGraph

fn default() -> Self

Returns the “default value” for a type.