Struct GraphDiffResult 

pub struct GraphDiffResult {
    pub nodes_added: AHashSet<i64>,
    pub nodes_removed: AHashSet<i64>,
    pub edges_added: Vec<(i64, i64)>,
    pub edges_removed: Vec<(i64, i64)>,
    pub similarity_score: f64,
    pub is_isomorphic: bool,
    pub graph_edit_distance: f64,
    pub graph1_size: usize,
    pub graph2_size: usize,
}

Complete graph diff result with delta and similarity metrics.

Combines structural delta information (nodes/edges added/removed) with similarity metrics from Phase 54 to provide comprehensive diff analysis.

Example

let diff = graph_diff(&graph1, &graph2)?;

println!("Nodes added: {}", diff.nodes_added.len());
println!("Nodes removed: {}", diff.nodes_removed.len());
println!("Similarity: {:.2}", diff.similarity_score);

if diff.is_safe() {
    println!("Refactor is safe - no breaking changes");
}

Fields

nodes_added: AHashSet<i64>

Node changes

nodes_removed: AHashSet<i64>

edges_added: Vec<(i64, i64)>

Edge changes

edges_removed: Vec<(i64, i64)>

similarity_score: f64

Structural similarity metrics (from Phase 54)

is_isomorphic: bool

graph_edit_distance: f64

graph1_size: usize

Graph sizes for context

graph2_size: usize

Implementations

impl GraphDiffResult

pub fn is_safe(&self) -> bool

Returns true if the diff represents a safe refactor.

A refactor is considered “safe” if:

• No nodes were removed (doesn’t break existing code)
• Similarity score >= 0.8 (very similar structure)

Example

if diff.is_safe() {
    println!("Refactor is safe");
} else {
    println!("Review changes before committing");
}

pub fn has_breaking_changes(&self) -> bool

Returns true if there are breaking changes.

Breaking changes include:

• Nodes removed (breaks existing references)
• Similarity < 0.5 (significant structural change)

Example

if diff.has_breaking_changes() {
    println!("WARNING: Breaking changes detected");
}

pub fn summary(&self) -> String

Returns a human-readable summary of the diff.

Example

println!("{}", diff.summary());
// Output: "Added 2 nodes, removed 1 node. Added 3 edges, removed 1 edge. Similarity: 0.85"

pub fn is_empty(&self) -> bool

Returns true if the diff has no changes (identical graphs).

pub fn total_changes(&self) -> usize

Returns the total number of changes (nodes + edges).

Trait Implementations

impl Clone for GraphDiffResult

fn clone(&self) -> GraphDiffResult

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphDiffResult

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

Formats the value using the given formatter.