qudag-dag 0.5.0

DAG consensus implementation for QuDAG - QR-Avalanche algorithm with Byzantine fault tolerance
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50

use crate::consensus::ConsensusError;
use crate::vertex::VertexError;
use thiserror::Error;

/// Errors that can occur during DAG operations
#[derive(Error, Debug)]
pub enum DagError {
    /// Node already exists in the graph
    #[error("Node {0} already exists")]
    NodeExists(String),

    /// Node not found in the graph
    #[error("Node {0} not found")]
    NodeNotFound(String),

    /// Invalid edge - creates a cycle
    #[error("Edge would create cycle between {from} and {to}")]
    CycleDetected {
        /// Source node of the cycle-creating edge
        from: String,
        /// Target node of the cycle-creating edge
        to: String,
    },

    /// Parent node missing for edge
    #[error("Parent node {0} missing for edge")]
    MissingParent(String),

    /// Child node missing for edge
    #[error("Child node {0} missing for edge")]
    MissingChild(String),

    /// Invalid node state transition
    #[error("Invalid state transition for node {0}")]
    InvalidStateTransition(String),

    /// Consensus error
    #[error("Consensus error: {0}")]
    ConsensusError(String),

    /// Vertex error
    #[error("Vertex error: {0}")]
    VertexError(#[from] VertexError),
}

impl From<ConsensusError> for DagError {
    fn from(err: ConsensusError) -> Self {
        DagError::ConsensusError(err.to_string())
    }
}