Struct PathFinder 

pub struct PathFinder { /* private fields */ }

Knowledge-graph path finder.

Implementations

impl PathFinder

pub fn new(edges: Vec<KnowledgeEdge>, config: PathFinderConfig) -> Self

Build a path finder from a set of edges.

pub fn add_edge(&mut self, edge: KnowledgeEdge)

Add a single edge to the graph.

pub fn bfs_paths( &self, source: &str, target: &str, max_depth: usize, ) -> Vec<KnowledgePath>

Find all paths from source to target using BFS up to max_depth hops.

Returns paths sorted by score (descending).

pub fn dfs_paths( &self, source: &str, target: &str, max_depth: usize, ) -> Vec<KnowledgePath>

Find all paths from source to target using DFS up to max_depth hops.

pub fn shortest_path(&self, source: &str, target: &str) -> Option<KnowledgePath>

Find the shortest path (minimum hops) from source to target.

Returns None when no path exists within max_depth.

pub fn multi_hop_paths( &self, source: &str, max_depth: usize, ) -> Vec<KnowledgePath>

Collect all paths up to depth N (multi-hop collection).

Returns paths to all reachable nodes that are different from source. Useful for building context windows.

pub fn stats(&self, paths: &[KnowledgePath]) -> PathFinderStats

Compute search statistics for the paths returned by a previous search.

pub fn node_count(&self) -> usize

Number of nodes in the graph.

pub fn edge_count(&self) -> usize

Number of edges in the graph.