Struct KnowledgeGraph 

pub struct KnowledgeGraph { /* private fields */ }

In-memory directed knowledge graph backed by adjacency lists

Implementations

impl KnowledgeGraph

pub fn new() -> Self

Create an empty graph.

pub fn add_node(&mut self, node: KgNode)

Insert or replace a node.

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

Append a directed edge. Both endpoint nodes are auto-created with default values if they do not yet exist.

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

Return outgoing (edge, target_node) pairs for node_id.

pub fn node_count(&self) -> usize

Number of nodes

pub fn edge_count(&self) -> usize

Number of edges

pub fn get_node(&self, id: &str) -> Option<&KgNode>

Look up a node by id.

Trait Implementations

impl Default for KnowledgeGraph

fn default() -> Self

Returns the “default value” for a type.