Struct GraphDesc 

pub struct GraphDesc {
    pub nodes: Vec<NodeDesc>,
    pub edges: Vec<EdgeDesc>,
}

A whole graph description: the single input type of every layout pass.

Node and edge ORDER is meaningful: it is the deterministic tiebreak for every heuristic in this crate (same GraphDesc in, same crate::Layout out — golden-test-pinned).

use abstracttui_graph::{layered, GraphDesc, LayeredOpts};

let desc = GraphDesc::new()
    .node("a", 8, 3)
    .node("b", 8, 3)
    .edge("a", "b");
let layout = layered(&desc, &LayeredOpts::default());
assert_eq!(layout.nodes.len(), 2);

Fields

nodes: Vec<NodeDesc>

Nodes, in caller order.

edges: Vec<EdgeDesc>

Edges, in caller order. Layout edges echo their index here so metadata (label/style) maps back even with duplicate endpoints.

Implementations

impl GraphDesc

pub fn new() -> Self

An empty graph.

pub fn node(self, id: impl Into<String>, w: i32, h: i32) -> Self

Append a node (fluent form of pushing a NodeDesc).

pub fn with_node(self, node: NodeDesc) -> Self

Append a fully-specified node.

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

Append an edge (fluent form of pushing an EdgeDesc).

pub fn with_edge(self, edge: EdgeDesc) -> Self

Append a fully-specified edge.

Trait Implementations

impl Clone for GraphDesc

fn clone(&self) -> GraphDesc

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GraphDesc

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

Formats the value using the given formatter.

impl Default for GraphDesc

fn default() -> GraphDesc

Returns the “default value” for a type.

impl Eq for GraphDesc

impl PartialEq for GraphDesc

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for GraphDesc