Struct Graph 

pub struct Graph {
    pub strict: bool,
    pub graph_type: GraphType,
    pub id: Option<String>,
    pub statements: Vec<Statement>,
    pub span: Range<usize>,
}

A graph definition (either a ‘graph’ or a ‘digraph’).

Fields

strict: bool

Whether the graph is strict (no multiple edges between same nodes).

graph_type: GraphType

The type of the graph (graph or digraph).

id: Option<String>

Optional identifier for the graph.

statements: Vec<Statement>

The list of statements within the graph.

span: Range<usize>

The source range of this graph definition.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate 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<'de> Deserialize<'de> for Graph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for Graph

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

Formats the value using the given formatter.

impl PartialEq for Graph

fn eq(&self, other: &Graph) -> 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 Graph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Graph