Struct KnowledgeGraph 

pub struct KnowledgeGraph {
    pub nodes: HashMap<String, GraphNode>,
    pub edges: HashMap<String, GraphEdge>,
    pub adjacency_list: HashMap<String, HashSet<String>>,
    pub reverse_adjacency_list: HashMap<String, HashSet<String>>,
    pub metadata: HashMap<String, Value>,
    pub created_at: DateTime<Utc>,
    pub updated_at: DateTime<Utc>,
}

Core knowledge graph structure

Fields

nodes: HashMap<String, GraphNode>

Graph nodes indexed by ID

edges: HashMap<String, GraphEdge>

Graph edges indexed by ID

adjacency_list: HashMap<String, HashSet<String>>

Node adjacency list for efficient traversal

reverse_adjacency_list: HashMap<String, HashSet<String>>

Reverse adjacency list for incoming edges

metadata: HashMap<String, Value>

Graph metadata

created_at: DateTime<Utc>

Graph creation timestamp

updated_at: DateTime<Utc>

Last update timestamp

Implementations

impl KnowledgeGraph

pub fn new() -> Self

Create a new empty knowledge graph

pub fn add_node(&mut self, node: GraphNode) -> RragResult<()>

Add a node to the graph

pub fn add_edge(&mut self, edge: GraphEdge) -> RragResult<()>

Add an edge to the graph

pub fn get_node(&self, node_id: &str) -> Option<&GraphNode>

Get node by ID

pub fn get_edge(&self, edge_id: &str) -> Option<&GraphEdge>

Get edge by ID

pub fn get_neighbors(&self, node_id: &str) -> Vec<&GraphNode>

Get neighbors of a node

pub fn get_incoming_neighbors(&self, node_id: &str) -> Vec<&GraphNode>

Get incoming neighbors of a node

pub fn get_node_edges(&self, node_id: &str) -> Vec<&GraphEdge>

Get edges connected to a node

pub fn remove_node(&mut self, node_id: &str) -> RragResult<()>

Remove a node and its connected edges

pub fn find_nodes_by_type(&self, node_type: &NodeType) -> Vec<&GraphNode>

Find nodes by type

pub fn find_edges_by_type(&self, edge_type: &EdgeType) -> Vec<&GraphEdge>

Find edges by type

pub fn calculate_metrics(&self) -> GraphMetrics

Calculate graph metrics

pub fn merge(&mut self, other: &KnowledgeGraph) -> RragResult<()>

Merge another graph into this one

pub fn clear(&mut self)

Clear the entire graph

Trait Implementations

impl Clone for KnowledgeGraph

fn clone(&self) -> KnowledgeGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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.

impl<'de> Deserialize<'de> for KnowledgeGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for KnowledgeGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.