Struct Graph 

pub struct Graph {
    pub label: Option<String>,
    pub directed: bool,
    pub nodes: BTreeMap<String, Node>,
    pub edges: Vec<Edge>,
}

A single JGF graph. Used for both a raw per-graph fragment (with label set to the graph name) and the composed graph (with label absent).

Nodes are keyed by path in a BTreeMap for deterministic, sorted output.

Fields

label: Option<String>

The graph name, present in a raw fragment, absent in the composed graph.

directed: bool

nodes: BTreeMap<String, Node>

edges: Vec<Edge>

Implementations

impl Graph

pub fn composed() -> Self

An empty composed (unlabeled) directed graph.

pub fn labeled(label: impl Into<String>) -> Self

An empty labeled directed graph (a raw per-graph fragment).

pub fn set_node(&mut self, path: impl Into<String>, node: Node)

Insert or replace the node at path.

pub fn add_edge(&mut self, edge: Edge)

Append an edge.

pub fn sort_edges(&mut self)

Sort edges by (source, target) for deterministic output.

pub fn into_document(self) -> GraphDocument

Wrap this graph as a composed JGF document ({"graph": {...}}).

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

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

Equality operator ==.

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

Inequality operator !=.

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