Enum Graph

pub enum Graph {
    Line,
    FourRegular,
}

The graph type to use for dandelion routing, the dandelion paper recommends Graph::FourRegular.

The decision between line graphs and 4-regular graphs depend on the priorities of the system, if linkability of transactions is a first order concern then line graphs may be better, however 4-regular graphs can give constant-order privacy benefits against adversaries with knowledge of the graph.

See appendix C of the dandelion++ paper.

Variants

Line

Line graph.

When this is selected one peer will be chosen from the outbound peers each epoch to route transactions to.

In general this is not recommend over Graph::FourRegular but may be better for certain systems.

FourRegular

Quasi-4-Regular.

When this is selected two peers will be chosen from the outbound peers each epoch, each stem transaction received will then be sent to one of these two peers. Transactions from the same node will always go to the same peer.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl Default for Graph

fn default() -> Graph

Returns the “default value” for a type.

impl Copy for Graph

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 1 byte

Size for each variant:

• Line: 0 bytes
• FourRegular: 0 bytes