Struct Graph 

pub struct Graph { /* private fields */ }

Represents the DAG data structure with high-performance concurrent access

Implementations

impl Graph

pub fn new() -> Self

Creates a new empty DAG

pub fn with_capacity(capacity: usize) -> Self

Creates a new Graph with specified initial capacity

pub fn with_config(config: StorageConfig) -> Self

Creates a new Graph with custom storage configuration

pub fn is_empty(&self) -> bool

Returns true if the DAG contains no nodes

pub fn len(&self) -> usize

Returns the number of nodes in the DAG

pub fn add_node(&self, node: Node) -> Result<()>

Adds a new node to the DAG

pub fn get_node(&self, hash: &Hash) -> Option<Node>

Returns a reference to a node by its hash

pub fn get_edges(&self, hash: &Hash) -> Option<HashSet<Edge>>

Returns all edges connected to a node

pub fn update_node_state(&self, hash: &Hash, new_state: NodeState) -> Result<()>

Updates the state of a node

pub fn prune(&self) -> Result<()>

Triggers pruning of old vertices

pub fn metrics(&self) -> GraphMetrics

Gets current performance metrics

Trait Implementations

impl Default for Graph

fn default() -> Self

Returns the “default value” for a type.