Expand description
Remove-Wins Graph CRDT implementation
This implementation completely removes deleted vertices and edges. It’s more memory-efficient but elements cannot be recovered.
Structs§
- Remove
Wins Graph - Remove-Wins Graph CRDT implementation
Remove-Wins Graph CRDT implementation
This implementation completely removes deleted vertices and edges. It’s more memory-efficient but elements cannot be recovered.