Struct ArchitectureKnowledgeGraph 

pub struct ArchitectureKnowledgeGraph { /* private fields */ }

A graph of architectures and their relationships.

Stores nodes contiguously in insertion order and indexes outgoing edges via an adjacency map for O(deg) neighbour lookups. The map is reconstructed from the edge list whenever the graph is loaded from JSON.

Implementations

impl ArchitectureKnowledgeGraph

pub fn new() -> Self

Construct an empty graph.

pub fn with_capacity(n: usize) -> Self

Construct an empty graph pre-allocating storage for n nodes.

pub fn len(&self) -> usize

Number of nodes in the graph.

pub fn is_empty(&self) -> bool

Returns true when the graph has no nodes.

pub fn edge_count(&self) -> usize

Number of edges in the graph.

pub fn add_architecture( &mut self, arch_id: impl Into<String>, embedding: Vec<f64>, domain: impl Into<String>, ) -> NodeId

Insert a new architecture into the graph and return its NodeId.

pub fn set_performance( &mut self, node: NodeId, record: PerformanceRecord, ) -> Result<()>

Attach a performance record to an existing node.

pub fn add_edge( &mut self, from: NodeId, to: NodeId, relation: RelationType, weight: f64, ) -> Result<()>

Add a typed weighted edge between two existing nodes.

Rejects edges that reference unknown nodes, that carry a non-finite weight, or whose weight is outside [-1, 1] for Similar edges.

pub fn node(&self, id: NodeId) -> Option<&ArchKnowledgeNode>

Borrow a node by id (returns None if it does not exist).

pub fn nodes(&self) -> &[ArchKnowledgeNode]

Borrow all nodes in insertion order.

pub fn neighbors(&self, id: NodeId) -> Vec<(NodeId, RelationType, f64)>

Outgoing neighbours of id, returned as (target, relation, weight).

Returns an empty vector for nodes with no outgoing edges or for unknown ids.

pub fn cosine_similarity(a: &[f64], b: &[f64]) -> f64

Cosine similarity between two vectors.

Returns 0.0 when either vector is the zero vector, when the lengths differ, or when any element is non-finite. This is safer than returning NaN for downstream ranking code.

pub fn find_similar( &self, query_embedding: &[f64], k: usize, ) -> Vec<(NodeId, f64)>

Top-k nodes by cosine similarity to query_embedding, descending.

Nodes whose embeddings are not comparable (mismatched length or zero-norm) are silently skipped. If k is zero or the graph is empty, returns an empty vector.

pub fn auto_add_similar_edges(&mut self, threshold: f64) -> usize

Add Similar edges between every distinct pair of nodes whose cosine similarity meets threshold. Returns the number of edges added.

Only one directed edge (i -> j) with i < j is added per pair to avoid duplicates and self-loops. Edges are skipped when an identical (from, to, Similar) triple already exists.

pub fn propagate_knowledge( &self, start: NodeId, decay: f64, depth: usize, ) -> Result<HashMap<NodeId, f64>>

Random-walk-with-restart from start.

At each of depth iterations every node redistributes decay × score to its outgoing neighbours (weighted by |weight| and normalised to sum to one). The remaining 1 - decay mass restarts at start. Dangling nodes — those without outgoing edges — return all their mass to start, and groups of neighbours whose weights sum to zero share the mass uniformly.

pub fn extract_top_k_transferable( &self, target_domain: &str, query_embedding: &[f64], k: usize, ) -> Vec<(NodeId, f64)>

Find up to k transferable architectures for target_domain.

A node is considered transferable if its own domain matches target_domain, or if any of its outgoing Transfers edges points to a node whose domain matches, or if it is itself the target of a Transfers edge from a node whose domain matches. Among the transferable nodes, the top-k by cosine similarity to query_embedding are returned (descending).

pub fn to_json(&self) -> Result<String>

Serialise the graph to a pretty-printed JSON string.

pub fn from_json(s: &str) -> Result<Self>

Parse a graph from a JSON string previously produced by to_json.

Trait Implementations

impl Clone for ArchitectureKnowledgeGraph

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ArchitectureKnowledgeGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for ArchitectureKnowledgeGraph

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for ArchitectureKnowledgeGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for ArchitectureKnowledgeGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.