Struct KnowledgeGraph 

pub struct KnowledgeGraph {
    pub communities: Vec<CommunityInfo>,
    pub hyperedges: Vec<Hyperedge>,
    /* private fields */
}

A knowledge graph backed by petgraph::StableGraph.

Provides ID-based node lookup and serialization to/from the NetworkX node_link_data JSON format for Python interoperability.

Fields

communities: Vec<CommunityInfo>

hyperedges: Vec<Hyperedge>

Implementations

impl KnowledgeGraph

pub fn new() -> Self

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

Add a node. Returns an error if a node with the same id already exists.

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

Add an edge between two nodes identified by their string IDs.

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

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

pub fn node_count(&self) -> usize

pub fn edge_count(&self) -> usize

pub fn set_hyperedges(&mut self, h: Vec<Hyperedge>)

Replace the hyperedges list.

pub fn node_ids(&self) -> Vec<String>

Iterate over all node IDs.

pub fn degree(&self, id: &str) -> usize

Get the degree (number of edges) for a node by id.

pub fn neighbor_ids(&self, id: &str) -> Vec<String>

Get neighbor IDs as strings.

pub fn nodes(&self) -> Vec<&GraphNode>

Collect all nodes as a Vec.

pub fn edges_with_endpoints(&self) -> Vec<(&str, &str, &GraphEdge)>

Iterate over all edges as (source_id, target_id, &GraphEdge).

pub fn edges(&self) -> Vec<&GraphEdge>

Iterate over all edge weights.

pub fn to_node_link_json(&self) -> Value

Serialize to the NetworkX node_link_data JSON format.

pub fn from_node_link_json(value: &Value) -> Result<Self>

Deserialize from the NetworkX node_link_data JSON format.

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.