Struct GraphDef 

pub struct GraphDef {
    pub name: String,
    pub edges: EdgeTable,
    pub vertices: Option<VertexTable>,
}

A graph as an algorithm sees it: one edge table, and the vertex table its endpoints refer to, if any. A whole graph before #295; now one pair of a PropertyGraph.

Fields

name: String

The graph’s name.

edges: EdgeTable

vertices: Option<VertexTable>

The vertex table, if the pair has one.

Trait Implementations

impl Clone for GraphDef

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 GraphDef

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

Formats the value using the given formatter.

impl Eq for GraphDef

impl From<GraphDef> for GraphSpec

A graph of one edge table and at most one vertex table, as a spec: what every graph was before #295, and what tests build.

fn from(def: GraphDef) -> Self

Converts to this type from the input type.

impl From<GraphDef> for PropertyGraph

A graph of one pair: what every graph was before #295.

fn from(def: GraphDef) -> Self

Converts to this type from the input type.

impl PartialEq for GraphDef

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for GraphDef