Interface Zherebko<Ops>

a simple topological layout operator.

This layout algorithm constructs a topological representation of the graph meant for visualization. The algorithm is based off a PR by D. Zherebko. The nodes are topologically ordered, and edges are then positioned into "lanes" to the left and right of the nodes.

Create with zherebko.

Type Parameters

Hierarchy

  • Zherebko

Methods

gap nodeSize rank tweaks

Methods

gap

  • set the gap size between nodes

    (default: [1, 1])

    Parameters

    • val: readonly [number, number]

    Returns Zherebko<Ops>

  • get the current gap size

    Returns readonly [number, number]

nodeSize

  • sets the NodeSize

    (default: [1, 1])

    Type Parameters

    Parameters

    • val: NewNodeSize

    Returns Zherebko<U<Ops, "nodeSize", NewNodeSize>>

  • get the current node size

    Returns Ops["nodeSize"]

rank

  • set the Rank operator for the topological ordering

    Type Parameters

    • NewRank extends Rank<never, never>

    Parameters

    • val: NewRank

    Returns Zherebko<U<Ops, "rank", NewRank>>

  • get the current lane operator

    Returns Ops["rank"]

tweaks

  • set the Tweaks to apply after layout

    Type Parameters

    • const NewTweaks extends readonly Tweak<never, never>[]

    Parameters

    • val: NewTweaks

    Returns Zherebko<U<Ops, "tweaks", NewTweaks>>

  • get the current Tweaks.

    Returns Ops["tweaks"]

Settings

Member Visibility

Theme

On This Page

Generated using TypeDoc