Module graph 

Graph CRDT implementations

This module provides graph-based CRDT implementations including:

• Add-Wins Graph: Preserves deleted elements for potential recovery
• Remove-Wins Graph: Completely removes deleted elements for memory efficiency
• Graph algorithms: Path finding, connectivity analysis, etc.

Re-exports

pub use add_wins::AddWinsGraph;

pub use add_wins::GraphConfig;

pub use algorithms::GraphAlgorithms;

pub use edge::Edge;

pub use edge::EdgeId;

pub use edge::EdgeMetadata;

pub use remove_wins::RemoveWinsGraph;

pub use vertex::GraphError;

pub use vertex::Vertex;

pub use vertex::VertexId;

pub use vertex::VertexMetadata;

Modules

add_wins

Add-Wins Graph CRDT implementation

algorithms

Graph algorithms and utilities

edge

Graph edge operations and types

remove_wins

Remove-Wins Graph CRDT implementation

vertex

Graph vertex operations and types

Enums

GraphStrategy

Strategy for handling graph conflicts