Struct RemoveWinsGraph 

pub struct RemoveWinsGraph<T> { /* private fields */ }

Remove-Wins Graph CRDT implementation

Implementations

impl<T: Clone + PartialEq + Eq + Send + Sync> RemoveWinsGraph<T>

pub fn new(replica: ReplicaId) -> Self

Create a new Remove-Wins graph

pub fn with_config(replica: ReplicaId, config: GraphConfig) -> Self

Create with custom configuration

pub fn add_vertex(&mut self, value: T, timestamp: u64) -> VertexId

Add a vertex to the graph

pub fn add_edge( &mut self, source: &VertexId, target: &VertexId, timestamp: u64, weight: Option<f64>, ) -> Result<EdgeId, GraphError>

Add an edge between two vertices

pub fn update_vertex( &mut self, id: &VertexId, value: T, timestamp: u64, ) -> Result<(), GraphError>

Update an existing vertex

pub fn update_edge( &mut self, id: &EdgeId, weight: f64, timestamp: u64, ) -> Result<(), GraphError>

Update an existing edge

pub fn remove_vertex(&mut self, id: &VertexId) -> Result<(), GraphError>

Remove a vertex completely

pub fn remove_edge(&mut self, id: &EdgeId) -> Result<(), GraphError>

Remove an edge completely

pub fn get_vertex(&self, id: &VertexId) -> Option<&Vertex<T>>

Get a vertex by ID

pub fn get_edge(&self, id: &EdgeId) -> Option<&Edge>

Get an edge by ID

pub fn vertices(&self) -> Vec<&Vertex<T>>

Get all vertices

pub fn edges(&self) -> Vec<&Edge>

Get all edges

pub fn neighbors(&self, id: &VertexId) -> Vec<&Vertex<T>>

Get neighbors of a vertex

pub fn incoming_edges(&self, id: &VertexId) -> Vec<&Edge>

Get incoming edges to a vertex

pub fn outgoing_edges(&self, id: &VertexId) -> Vec<&Edge>

Get outgoing edges from a vertex

pub fn shortest_path( &self, source: &VertexId, target: &VertexId, ) -> Option<Vec<VertexId>>

Find shortest path between two vertices using BFS

pub fn contains_vertex(&self, id: &VertexId) -> bool

Check if the graph contains a vertex

pub fn contains_edge(&self, id: &EdgeId) -> bool

Check if the graph contains an edge

pub fn vertex_count(&self) -> usize

Get the number of vertices

pub fn edge_count(&self) -> usize

Get the number of edges

pub fn is_empty(&self) -> bool

Check if the graph is empty

pub fn clear(&mut self)

Clear all vertices and edges

Trait Implementations

impl<T: Clone + PartialEq + Eq + Send + Sync> CRDT for RemoveWinsGraph<T>

fn replica_id(&self) -> &ReplicaId

impl<T: Clone> Clone for RemoveWinsGraph<T>

fn clone(&self) -> RemoveWinsGraph<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for RemoveWinsGraph<T>

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for RemoveWinsGraph<T>

where T: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: Clone + PartialEq + Eq + Send + Sync> Mergeable for RemoveWinsGraph<T>

type Error = GraphError

fn merge(&mut self, other: &Self) -> Result<(), Self::Error>

Merge this instance with another instance

fn has_conflict(&self, other: &Self) -> bool

Check if there’s a conflict with another instance

impl<T: PartialEq> PartialEq for RemoveWinsGraph<T>

fn eq(&self, other: &RemoveWinsGraph<T>) -> 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<T> Serialize for RemoveWinsGraph<T>

where T: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T> StructuralPartialEq for RemoveWinsGraph<T>