Struct EdgeDelta 

pub struct EdgeDelta {
    pub edges_added: Vec<(i64, i64)>,
    pub edges_removed: Vec<(i64, i64)>,
}

Result of computing edge delta between two graphs.

Contains lists of edges that were added or removed when comparing graph2 to graph1. Each edge is represented as a tuple (from_id, to_id).

Example

let delta = EdgeDelta {
    edges_added: vec![(1, 2), (2, 3)],
    edges_removed: vec![(4, 5)],
};

println!("Added {} edges", delta.edges_added.len()); // 2
println!("Removed {} edges", delta.edges_removed.len()); // 1

Fields

edges_added: Vec<(i64, i64)>

Edges present in graph2 but not in graph1 (from_id, to_id)

edges_removed: Vec<(i64, i64)>

Edges present in graph1 but not in graph2 (from_id, to_id)

Trait Implementations

impl Clone for EdgeDelta

fn clone(&self) -> EdgeDelta

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EdgeDelta

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

Formats the value using the given formatter.

impl PartialEq for EdgeDelta

fn eq(&self, other: &EdgeDelta) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for EdgeDelta

impl StructuralPartialEq for EdgeDelta