Module shard 

Graph sharding strategies for distributed hypergraphs

Provides multiple partitioning strategies optimized for graph workloads:

• Hash-based node partitioning for uniform distribution
• Range-based partitioning for locality-aware queries
• Edge-cut minimization for reducing cross-shard communication

Structs

EdgeCutMinimizer

Edge-cut minimization using METIS-like graph partitioning

EdgeData

Edge data in the graph

GraphShard

Graph shard containing partitioned data

HashPartitioner

Hash-based node partitioner

NodeData

Node data in the graph

RangePartitioner

Range-based node partitioner for ordered node IDs

ShardMetadata

Metadata about a graph shard

Enums

ShardStrategy

Graph sharding strategy

Type Aliases

EdgeId

Unique identifier for a graph edge

NodeId

Unique identifier for a graph node

ShardId

Shard identifier