Struct GraphTraversal 

pub struct GraphTraversal { /* private fields */ }

Graph traversal system implementing various search algorithms

Implementations

impl GraphTraversal

pub fn new(config: TraversalConfig) -> Self

Create a new graph traversal system

pub fn default() -> Self

Create with default configuration

pub fn bfs( &self, graph: &KnowledgeGraph, source: &EntityId, ) -> Result<TraversalResult>

Breadth-First Search (BFS) from a source entity

BFS explores the graph level by level, guaranteeing shortest paths. Ideal for finding entities within a certain distance from the source.

Arguments

• graph - The knowledge graph to traverse
• source - Starting entity ID

Returns

TraversalResult with entities, relationships, and distances

pub fn dfs( &self, graph: &KnowledgeGraph, source: &EntityId, ) -> Result<TraversalResult>

Depth-First Search (DFS) from a source entity

DFS explores as far as possible along each branch before backtracking. Useful for finding all possible paths and deep exploration.

Arguments

• graph - The knowledge graph to traverse
• source - Starting entity ID

Returns

TraversalResult with entities, relationships, and discovered paths

pub fn ego_network( &self, graph: &KnowledgeGraph, entity_id: &EntityId, k_hops: Option<usize>, ) -> Result<TraversalResult>

Extract K-hop ego-network around an entity

An ego-network is a subgraph containing all entities within K hops of the source entity. This is useful for context-aware retrieval.

Arguments

• graph - The knowledge graph
• entity_id - Center entity for the ego-network
• k_hops - Number of hops to include (defaults to config.max_depth)

Returns

TraversalResult with the ego-network subgraph

pub fn multi_source_bfs( &self, graph: &KnowledgeGraph, sources: &[EntityId], ) -> Result<TraversalResult>

Multi-source BFS pathfinding

Performs simultaneous BFS from multiple source entities to find intersections and common neighbors efficiently.

Arguments

• graph - The knowledge graph
• sources - Multiple starting entity IDs

Returns

TraversalResult with entities reachable from any source

pub fn find_all_paths( &self, graph: &KnowledgeGraph, source: &EntityId, target: &EntityId, ) -> Result<TraversalResult>

Find all paths between two entities

Uses DFS to discover all possible paths from source to target within the maximum depth limit.

Arguments

• graph - The knowledge graph
• source - Starting entity
• target - Target entity

Returns

TraversalResult with all discovered paths

pub fn query_focused_subgraph( &self, graph: &KnowledgeGraph, seed_entities: &[EntityId], expansion_hops: usize, ) -> Result<TraversalResult>

Extract query-focused subgraph

Extracts a subgraph relevant to a specific query by:

1. Identifying seed entities from query
2. Expanding via ego-networks
3. Filtering by relevance

Arguments

• graph - The knowledge graph
• seed_entities - Starting entities identified in query
• expansion_hops - How many hops to expand

Returns

TraversalResult with query-relevant subgraph