Struct KnowledgeGraph 

pub struct KnowledgeGraph {
    pub nodes: HashMap<String, KgNode>,
    pub edges: Vec<KgEdge>,
    pub adjacency: HashMap<String, Vec<usize>>,
}

A directed knowledge graph whose nodes are predicates, constants, variables, or rules, and whose edges encode semantic relationships among them.

Adjacency is maintained as a map from node ID to a list of indices into the edges vector for O(1) lookup of outgoing edges.

Fields

nodes: HashMap<String, KgNode>

All nodes, keyed by their unique identifier.

edges: Vec<KgEdge>

All edges stored in insertion order.

adjacency: HashMap<String, Vec<usize>>

node_id → indices into edges for edges leaving that node.

Implementations

impl KnowledgeGraph

pub fn new() -> Self

Create an empty knowledge graph.

pub fn add_node(&mut self, node: KgNode) -> Result<(), KgError>

Insert a node. Returns KgError::DuplicateNode if the ID already exists.

pub fn add_edge(&mut self, edge: KgEdge) -> Result<(), KgError>

Insert an edge. Both endpoints must already exist as nodes.

Returns KgError::EdgeEndpointMissing if either endpoint is absent.

pub fn node_count(&self) -> usize

Number of nodes in the graph.

pub fn edge_count(&self) -> usize

Number of edges in the graph.

pub fn neighbors(&self, node_id: &str) -> Vec<&KgNode>

Return references to all nodes directly reachable from node_id via outgoing edges (i.e. the immediate successors).

Returns an empty slice if the node has no outgoing edges or does not exist.

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() -> KnowledgeGraph

Returns the “default value” for a type.