Struct GraphTraversal 

pub struct GraphTraversal<'a> { /* private fields */ }

Graph traversal utilities

Implementations

impl<'a> GraphTraversal<'a>

pub const fn new(graph: &'a MemoryGraph) -> Self

Create a new graph traversal helper

Examples

let traversal = GraphTraversal::new(&graph);

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

Perform breadth-first search from a starting node

Returns nodes in BFS order.

Errors

Returns an error if graph traversal fails.

Examples

let traversal = GraphTraversal::new(&graph);
let nodes = traversal.bfs(prompt_id)?;

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

Perform depth-first search from a starting node

Returns nodes in DFS order.

Errors

Returns an error if graph traversal fails.

Examples

let traversal = GraphTraversal::new(&graph);
let nodes = traversal.dfs(prompt_id)?;

pub fn get_conversation_thread(&self, start: NodeId) -> Result<Vec<Node>>

Get the conversation thread for a prompt or response

Returns nodes in chronological order (oldest to newest).

Errors

Returns an error if node retrieval fails.

Examples

let traversal = GraphTraversal::new(&graph);
let thread = traversal.get_conversation_thread(prompt_id)?;

pub fn find_responses(&self, prompt_id: NodeId) -> Result<Vec<Node>>

Find all responses to a prompt

Errors

Returns an error if edge or node retrieval fails.

Examples

let traversal = GraphTraversal::new(&graph);
let responses = traversal.find_responses(prompt_id)?;