Struct KnowledgeGraph 

pub struct KnowledgeGraph { /* private fields */ }

The main knowledge graph container.

Implementations

impl KnowledgeGraph

pub fn new(strict_mode: bool) -> Self

Creates a new empty knowledge graph.

pub fn is_strict_mode(&self) -> bool

Returns whether strict mode is enabled.

pub fn item_count(&self) -> usize

Returns the number of items in the graph.

pub fn relationship_count(&self) -> usize

Returns the number of relationships in the graph.

pub fn add_item(&mut self, item: Item) -> NodeIndex

Adds an item to the graph.

pub fn add_relationship( &mut self, from: &ItemId, to: &ItemId, rel_type: RelationshipType, ) -> Option<()>

Adds a relationship between two items.

pub fn get(&self, id: &ItemId) -> Option<&Item>

Gets an item by ID.

pub fn get_mut(&mut self, id: &ItemId) -> Option<&mut Item>

Gets a mutable reference to an item by ID.

pub fn contains(&self, id: &ItemId) -> bool

Checks if an item exists in the graph.

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

Returns all items in the graph.

pub fn item_ids(&self) -> impl Iterator<Item = &ItemId>

Returns all item IDs in the graph.

pub fn items_by_type(&self, item_type: ItemType) -> Vec<&Item>

Returns all items of a specific type.

pub fn count_by_type(&self) -> HashMap<ItemType, usize>

Returns the count of items by type.

pub fn parents(&self, id: &ItemId) -> Vec<&Item>

Returns direct parents of an item (items that this item relates to upstream).

pub fn children(&self, id: &ItemId) -> Vec<&Item>

Returns direct children of an item (items that relate to this item downstream).

pub fn orphans(&self) -> Vec<&Item>

Returns all items with no upstream parents (potential orphans).

pub fn inner(&self) -> &DiGraph<Item, RelationshipType>

Returns the underlying petgraph for advanced operations.

pub fn inner_mut(&mut self) -> &mut DiGraph<Item, RelationshipType>

Returns a mutable reference to the underlying petgraph.

pub fn node_index(&self, id: &ItemId) -> Option<NodeIndex>

Returns the node index for an item ID.

pub fn has_cycles(&self) -> bool

Checks if the graph has cycles.

pub fn relationships(&self) -> Vec<(ItemId, ItemId, RelationshipType)>

Returns all relationships in the graph.

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.