Struct Graph 

pub struct Graph {

    pub name: String,
    pub strict: bool,
    pub kind: GraphKind,
    pub graph_attrs: BTreeMap<String, String>,
    pub node_defaults: BTreeMap<String, String>,
    pub edge_defaults: BTreeMap<String, String>,
    pub nodes: Vec<NodeData>,
    pub node_lookup: BTreeMap<String, NodeId>,
    pub edges: Vec<EdgeData>,
    pub subgraphs: Vec<SubgraphData>,
    pub bb: BoundingBox,
    pub html_strings: BTreeSet<String>,
    pub anon_subgraph_ids: BTreeMap<u32, u64>,
    pub dicts: Vec<AttrDicts>,
    pub render_view: Option<Box<Graph>>,
}

Arena-backed Graph representation (Fixes GV-BUG-008 and GV-BUG-010).

Fields

name: String

strict: bool

kind: GraphKind

graph_attrs: BTreeMap<String, String>

node_defaults: BTreeMap<String, String>

edge_defaults: BTreeMap<String, String>

nodes: Vec<NodeData>

node_lookup: BTreeMap<String, NodeId>

edges: Vec<EdgeData>

subgraphs: Vec<SubgraphData>

bb: BoundingBox

html_strings: BTreeSet<String>

Attribute values that were written as HTML strings (<...>) in the source, stored with their delimiters. A quoted "<x>" is a plain string and is not recorded here.

anon_subgraph_ids: BTreeMap<u32, u64>

cgraph’s internal ids of anonymous subgraphs (subgraph index -> id); the root graph, anonymous subgraphs and edges draw odd ids from one counter in creation order. C prints an anonymous subgraph’s name as %<id>.

dicts: Vec<AttrDicts>

cgraph attribute dictionaries (Agdatadict_t) as built while parsing: index 0 is the root graph, index i + 1 subgraph i. Writers that reproduce agwrite use them to tell local declarations from inherited values.

render_view: Option<Box<Graph>>

The graph as renderers that run before undoClusterEdges see it: fdp leaves its cluster nodes (__0:cluster) and cloned cluster edges in the graph it lays out, and only the output writers (dot, xdot, json, canon, plain) undo them. -Tsvg draws this graph when it is set.

Implementations

impl Graph

pub fn new(name: impl Into<String>, kind: GraphKind, strict: bool) -> Graph

pub fn ensure_node(&mut self, name: &str) -> NodeId

pub fn add_edge( &mut self, tail: NodeId, head: NodeId, attrs: BTreeMap<String, String>, ) -> EdgeId

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<(), Error>

Formats the value using the given formatter.

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

fn deserialize<__D>( __deserializer: __D, ) -> Result<Graph, <__D as Deserializer<'de>>::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 as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Graph