Struct KnowledgeGraph 

pub struct KnowledgeGraph { /* private fields */ }

Knowledge graph containing entities and their relationships

Implementations

impl KnowledgeGraph

pub fn new() -> Self

Create a new empty knowledge graph

pub fn add_document(&mut self, document: Document) -> Result<()>

Add a document to the knowledge graph

pub fn add_entity(&mut self, entity: Entity) -> Result<NodeIndex>

Add an entity to the knowledge graph

pub fn add_relationship(&mut self, relationship: Relationship) -> Result<()>

Add a relationship between entities

pub fn add_chunk(&mut self, chunk: TextChunk) -> Result<()>

Add a chunk to the knowledge graph

pub fn get_entity(&self, id: &EntityId) -> Option<&Entity>

Get an entity by ID

pub fn get_document(&self, id: &DocumentId) -> Option<&Document>

Get a document by ID

pub fn get_chunk(&self, id: &ChunkId) -> Option<&TextChunk>

Get a chunk by ID

pub fn get_entity_mut(&mut self, id: &EntityId) -> Option<&mut Entity>

Get a mutable reference to an entity by ID

pub fn get_chunk_mut(&mut self, id: &ChunkId) -> Option<&mut TextChunk>

Get a mutable reference to a chunk by ID

pub fn entities(&self) -> impl Iterator<Item = &Entity>

Get all entities

pub fn entities_mut(&mut self) -> impl Iterator<Item = &mut Entity>

Get all entities (mutable)

pub fn documents(&self) -> impl Iterator<Item = &Document>

Get all documents

pub fn documents_mut(&mut self) -> impl Iterator<Item = &mut Document>

Get all documents (mutable)

pub fn chunks(&self) -> impl Iterator<Item = &TextChunk>

Get all chunks

pub fn chunks_mut(&mut self) -> impl Iterator<Item = &mut TextChunk>

Get all chunks (mutable)

pub fn get_neighbors( &self, entity_id: &EntityId, ) -> Vec<(&Entity, &Relationship)>

Get neighbors of an entity

pub fn get_all_relationships(&self) -> Vec<&Relationship>

Get all relationships in the graph

pub fn load_from_json(file_path: &str) -> Result<Self>

Load knowledge graph from JSON file

pub fn save_to_json(&self, file_path: &str) -> Result<()>

Save knowledge graph to JSON file with optimized format for entities and relationships

pub fn find_entities_by_name(&self, name: &str) -> impl Iterator<Item = &Entity>

Find entities by name (case-insensitive partial match)

pub fn get_entity_by_id(&self, id: &str) -> Option<&Entity>

Get entity by ID (string version for compatibility)

pub fn get_entity_relationships( &self, entity_id: &str, ) -> impl Iterator<Item = &Relationship>

Get entity relationships

pub fn find_relationship_path( &self, entity1: &str, entity2: &str, _max_depth: usize, ) -> Vec<String>

Find relationship path between two entities (simplified BFS)

pub fn entity_count(&self) -> usize

Count entities in the graph

pub fn relationship_count(&self) -> usize

Count relationships in the graph

pub fn document_count(&self) -> usize

Count documents in the graph

pub fn relationships(&self) -> impl Iterator<Item = &Relationship>

Get all relationships as an iterator

pub fn clear_entities_and_relationships(&mut self)

Clear all entities and relationships while preserving documents and chunks

This is useful for rebuilding the graph from scratch without reloading documents.

Trait Implementations

impl Debug for KnowledgeGraph

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

Formats the value using the given formatter.

impl Default for KnowledgeGraph

fn default() -> Self

Returns the “default value” for a type.