Struct KnowledgeGraph 

pub struct KnowledgeGraph { /* private fields */ }

A knowledge graph with typed entities and relations.

Example

use cvx_graph::{KnowledgeGraph, Entity, EntityType, Relation, RelationType};

let mut kg = KnowledgeGraph::new();

// Define a task plan
let task = kg.add_entity(Entity::new(1, EntityType::Task, "heat_then_place"));
let find = kg.add_entity(Entity::new(2, EntityType::Action, "find"));
let take = kg.add_entity(Entity::new(3, EntityType::Action, "take"));
let heat = kg.add_entity(Entity::new(4, EntityType::Action, "heat"));

kg.add_relation(Relation::new(task, find, RelationType::Requires, 1.0));
kg.add_relation(Relation::new(find, take, RelationType::Precedes, 1.0));
kg.add_relation(Relation::new(take, heat, RelationType::Precedes, 1.0));

// Query: what steps does heat_then_place require?
let steps = kg.neighbors(task, Some(RelationType::Requires));
assert_eq!(steps.len(), 1);

// Multi-hop: what comes after find?
let chain = kg.traverse(find, &[RelationType::Precedes], 3);
assert!(chain.len() >= 2); // take, heat

Implementations

impl KnowledgeGraph

pub fn new() -> Self

Create an empty graph.

pub fn add_entity(&mut self, entity: Entity) -> EntityId

Add an entity. Returns its ID.

pub fn add_relation(&mut self, relation: Relation)

Add a directed relation.

pub fn entity(&self, id: EntityId) -> Option<&Entity>

Get an entity by ID.

pub fn entities_by_type(&self, entity_type: &EntityType) -> Vec<&Entity>

Get all entities of a given type.

pub fn neighbors( &self, entity_id: EntityId, relation_type: Option<RelationType>, ) -> Vec<(&Entity, &Relation)>

Get outgoing neighbors, optionally filtered by relation type.

pub fn incoming_neighbors( &self, entity_id: EntityId, relation_type: Option<RelationType>, ) -> Vec<(&Entity, &Relation)>

Get incoming neighbors (reverse edges).

pub fn traverse( &self, start: EntityId, relation_types: &[RelationType], max_hops: usize, ) -> Vec<(EntityId, usize)>

Multi-hop traversal following specified relation types.

Returns all reachable entities with their hop distance.

pub fn find_path( &self, from: EntityId, to: EntityId, relation_types: &[RelationType], max_hops: usize, ) -> Option<Vec<EntityId>>

Find a path between two entities following given relation types.

Returns the path as a sequence of entity IDs, or None if no path.

pub fn task_plan(&self, task_id: EntityId) -> Vec<EntityId>

Get the ordered sequence of steps for a task.

Follows Requires from the task, then Precedes between steps.

pub fn n_entities(&self) -> usize

Number of entities.

pub fn n_relations(&self) -> usize

Number of relations.

pub fn stats(&self) -> String

Summary statistics.

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.

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.