Struct CounterExample 

pub struct CounterExample {
    pub algorithm: ReferenceAlgorithm,
    pub graph_edges: Vec<(String, String)>,
    pub node_count: usize,
    pub directed: bool,
    pub witness_a: ComplexityWitness,
    pub witness_b: ComplexityWitness,
    pub discrepancy: String,
}

A counter-example candidate found during witness-hash mining.

When two executions of the same algorithm on the same graph produce different witness hashes, we have found a potential non-determinism bug.

Fields

algorithm: ReferenceAlgorithm

The algorithm that exhibited non-determinism.

graph_edges: Vec<(String, String)>

The graph that triggered the issue (serialized as edge list).

node_count: usize

Number of nodes in the graph.

directed: bool

Whether the graph is directed.

witness_a: ComplexityWitness

Witness from the first run.

witness_b: ComplexityWitness

Witness from the second run.

discrepancy: String

Description of the discrepancy.

Trait Implementations

impl Clone for CounterExample

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for CounterExample

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for CounterExample

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for CounterExample

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.