Struct LayeredOpts 

pub struct LayeredOpts {
    pub direction: Direction,
    pub node_gap: i32,
    pub rank_gap: i32,
    pub sweeps: u32,
    pub node_cap: usize,
}

Options for layered. Author-written, shape-stable: construct via functional record update over Default (ADR-0003 §2):

use abstracttui_graph::{Direction, LayeredOpts};
let opts = LayeredOpts {
    direction: Direction::LeftRight,
    ..Default::default()
};

Fields

direction: Direction

Flow direction of the picture (default: Direction::TopDown).

node_gap: i32

Minimum cells between sibling cards along the cross axis (default 3, clamped to at least 1).

rank_gap: i32

Cells between rank bands along the flow axis — the corridor edge waypoints route through (default 2, clamped to at least 1).

sweeps: u32

Bound on crossing-reduction sweeps (default 4). Each sweep is one downward plus one upward median pass; the best ordering seen wins. More sweeps buy diminishing quality, never correctness.

node_cap: usize

Node cap (default 512). Graphs with more nodes degrade to the grid placement with a fallback label naming the cap — a labeled grid beats a slow or hung solver at terminal scale.

Trait Implementations

impl Clone for LayeredOpts

fn clone(&self) -> LayeredOpts

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LayeredOpts

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

Formats the value using the given formatter.

impl Default for LayeredOpts

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for LayeredOpts

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for LayeredOpts