Struct Graph 

pub struct Graph {
    direction: Direction,
    nodes: Vec<Box<str>>,
    edges: Vec<(Box<str>, Box<str>)>,
}

Builder for mermaid flowchart diagrams.

Fields

direction: Direction

nodes: Vec<Box<str>>

edges: Vec<(Box<str>, Box<str>)>

Implementations

impl Graph

pub fn new(direction: Direction) -> Self

Create a new graph with the given direction.

pub fn node(self, name: impl Into<String>) -> Self

Add a standalone node (rendered only if it has no edges).

pub fn nodes<I, T>(self, names: I) -> Self

where I: IntoIterator<Item = T>, T: Into<String>,

Add multiple standalone nodes.

pub fn edge(self, from: impl Into<String>, to: impl Into<String>) -> Self

Add a directed edge from from to to.

pub fn edges<I, F, T>(self, edges: I) -> Self

where I: IntoIterator<Item = (F, T)>, F: Into<String>, T: Into<String>,

Add multiple edges.

pub fn build(self) -> String

Render as a mermaid code block, or empty string if there are no edges.

Trait Implementations

impl Debug for Graph

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

Formats the value using the given formatter.

impl Default for Graph

fn default() -> Self

Returns the “default value” for a type.