Struct Graph 

pub struct Graph {
    pub id: String,
    pub title: String,
    pub description: String,
    pub source: String,
    pub node_kinds: BTreeMap<String, String>,
    pub edge_kinds: BTreeMap<String, String>,
    pub nodes: Vec<Node>,
    pub edges: Vec<Edge>,
    pub metadata: GraphMetadata,
}

A derived graph: what it is, where it came from, what its vocabularies mean, and the nodes and edges themselves.

Fields

id: String

The identity, [a-z][a-z0-9-]*; the last segment of its route.

title: String

The short name.

description: String

One paragraph: what a reader learns from it.

source: String

What it was derived from, in the repository’s own words.

node_kinds: BTreeMap<String, String>

Node kind to what that kind means.

edge_kinds: BTreeMap<String, String>

Edge kind to what that edge asserts.

nodes: Vec<Node>

Sorted by id.

edges: Vec<Edge>

Sorted.

metadata: GraphMetadata

Counts and invariants.

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

impl JsonSchema for Graph

fn schema_name() -> Cow<'static, str>

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(generator: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn inline_schema() -> bool

Whether JSON Schemas generated for this type should be included directly in parent schemas, rather than being re-used where possible using the $ref keyword.

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