Struct CompactGraph 

pub struct CompactGraph {
    pub metadata: Metadata,
    pub nodes: Vec<Node>,
    pub edges: Vec<Edge>,
}

A graph data storage type that allows for more compact serialization.

Fields

metadata: Metadata

nodes: Vec<Node>

edges: Vec<Edge>

Trait Implementations

impl Clone for CompactGraph

fn clone(&self) -> CompactGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CompactGraph

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

Formats the value using the given formatter.

impl Default for CompactGraph

fn default() -> CompactGraph

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for CompactGraph

where CompactGraph: Default,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl From<Graph> for CompactGraph

fn from(value: Graph) -> Self

Converts to this type from the input type.

impl PartialEq for CompactGraph

fn eq(&self, other: &CompactGraph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for CompactGraph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl TryInto<Graph> for CompactGraph

type Error = Error

The type returned in the event of a conversion error.

fn try_into(self) -> Result<Graph, Self::Error>

Performs the conversion.

impl StructuralPartialEq for CompactGraph