Module add_wins

Expand description

Add-Wins Graph CRDT implementation

This implementation ensures that vertices and edges are never completely lost. Deleted elements are marked as deleted but preserved for potential recovery.