Struct Graph 

#[non_exhaustive]
pub struct Graph {
    pub desc: Option<String>,
    pub edges: Option<Vec<Edge>>,
    pub is_directed: Option<bool>,
    pub name: Option<String>,
    pub nodes: Option<Vec<Node>>,
    pub query_language: Option<String>,
    pub query_language_id: Option<i64>,
    pub type: Option<String>,
    pub uid: Option<String>,
}

Graph

A graph data structure representation with nodes and edges.

[] Category: | Name: graph

Constraints:

• at_least_one: [name,uid]

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

desc: Option<String>

Description

The graph description - provides additional details about the graph’s purpose and contents.

optional

edges: Option<Vec<Edge>>

Edges

The edges/connections between nodes in the graph - contains the collection of edge objects defining relationships between nodes.

optional

is_directed: Option<bool>

Directed

Indicates if the graph is directed (true) or undirected (false).

optional

name: Option<String>

Name

The graph name - a human readable identifier for the graph.

recommended

nodes: Option<Vec<Node>>

Nodes

The nodes/vertices of the graph - contains the collection of node objects that make up the graph.

required

query_language: Option<String>

Query Language

The graph query language, normalized to the caption of the query_language_id value.

optional

query_language_id: Option<i64>

Query Language ID

The normalized identifier of a graph query language that can be used to interact with the graph.

recommended

type: Option<String>

Type

The graph type. Typically useful to represent the specific type of graph that is used.

optional

uid: Option<String>

Unique ID

Unique identifier of the graph - a unique ID to reference this specific graph.

recommended

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 Default for Graph

fn default() -> Graph

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Graph

where Graph: Default,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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