Struct LineageGraph 

pub struct LineageGraph {
    pub nodes: Vec<LineageNode>,
    pub edges: Vec<LineageEdgeRecord>,
}

A lineage graph showing model derivation history.

Fields

nodes: Vec<LineageNode>

Nodes in the graph.

edges: Vec<LineageEdgeRecord>

Edges representing derivation relationships.

Implementations

impl LineageGraph

pub fn new() -> Self

Create an empty lineage graph.

pub fn add_node(&mut self, node: LineageNode) -> usize

Add a node to the graph.

pub fn add_edge( &mut self, from_idx: usize, to_idx: usize, edge: ModelLineageEdge, )

Add an edge to the graph.

pub fn node_count(&self) -> usize

Get the number of nodes.

pub fn edge_count(&self) -> usize

Get the number of edges.

pub fn ancestors(&self, node_idx: usize) -> Vec<usize>

Get ancestors of a node (models it was derived from).

pub fn descendants(&self, node_idx: usize) -> Vec<usize>

Get descendants of a node (models derived from it).

pub fn find_node(&self, model_id: &ModelId) -> Option<usize>

Find node index by model ID.

pub fn all_ancestors(&self, node_idx: usize) -> Vec<usize>

Get all ancestors of a node (full transitive closure).

Returns all nodes from which this model was derived, recursively.

pub fn all_descendants(&self, node_idx: usize) -> Vec<usize>

Get all descendants of a node (full transitive closure).

Returns all nodes derived from this model, recursively.

pub fn root_nodes(&self) -> Vec<usize>

Get root models (models with no parents).

pub fn leaf_nodes(&self) -> Vec<usize>

Get leaf models (models with no children).

pub fn path_between(&self, from_idx: usize, to_idx: usize) -> Option<Vec<usize>>

Find path between two nodes (returns node indices from source to target).

Uses BFS to find shortest path. Returns None if no path exists.

pub fn topological_sort(&self) -> Option<Vec<usize>>

Perform topological sort of the graph.

Returns nodes in order such that parents come before children. Returns None if the graph has a cycle.

pub fn depth(&self, node_idx: usize) -> usize

Get depth of a node (longest path from any root).

pub fn edges_between( &self, from_idx: usize, to_idx: usize, ) -> Vec<&LineageEdgeRecord>

Get the edges connecting two specific nodes.

pub fn is_dag(&self) -> bool

Check if the graph is a DAG (directed acyclic graph).

Trait Implementations

impl Clone for LineageGraph

fn clone(&self) -> LineageGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LineageGraph

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

Formats the value using the given formatter.

impl Default for LineageGraph

fn default() -> LineageGraph

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for LineageGraph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for LineageGraph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.