Struct ConvergenceGraph 

pub struct ConvergenceGraph {
    pub points: BTreeMap<PointId, ConvergencePoint>,
    pub edges: Vec<TypedEdge>,
}

The complete convergence graph across all substrates.

Fields

points: BTreeMap<PointId, ConvergencePoint>

All points, keyed by hex-encoded PointId. (BTreeMap keys must be strings for JSON serialization.)

edges: Vec<TypedEdge>

Typed edges between points.

Implementations

impl ConvergenceGraph

pub fn new() -> Self

Create an empty graph.

pub fn add_point(&mut self, id: PointId, point: ConvergencePoint)

Add a convergence point, returning its PointId.

pub fn add_edge(&mut self, edge: TypedEdge)

Add a typed edge between two points.

pub fn topological_order(&self) -> Result<Vec<PointId>, GraphError>

Compute topological order using Kahn’s algorithm. Returns Err if the graph contains a cycle.

pub fn validate(&self) -> Result<(), GraphError>

Validate the graph: all edge endpoints exist, no cycles.

pub fn points_by_substrate( &self, substrate: &SubstrateType, ) -> Vec<(&PointId, &ConvergencePoint)>

Filter points by substrate type.

pub fn point_count(&self) -> usize

Get the number of points.

pub fn edge_count(&self) -> usize

Get the number of edges.

pub fn forward_closure(&self, point_id: &PointId) -> BTreeSet<PointId>

Compute forward closure: all points this point transitively depends on. Walks backward along edges (from → to) to find all upstream dependencies. Like nix-store --query --requisites.

pub fn reverse_closure(&self, point_id: &PointId) -> BTreeSet<PointId>

Compute reverse closure: all points that transitively depend on this point. Walks forward along edges (from → to) to find all downstream dependents. Like nix-store --query --referrers (transitive).

Trait Implementations

impl Clone for ConvergenceGraph

fn clone(&self) -> ConvergenceGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ConvergenceGraph

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

Formats the value using the given formatter.

impl Default for ConvergenceGraph

fn default() -> ConvergenceGraph

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for ConvergenceGraph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for ConvergenceGraph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.