d3-dag
    Preparing search index...

    Interface LaneGreedy

    a lane operator that assigns lanes greedily, but quickly.

    Create with laneGreedy.

    interface LaneGreedy {
        bidirectional(val: boolean): LaneGreedy;
        bidirectional(): boolean;
        compressed(val: boolean): LaneGreedy;
        compressed(): boolean;
        topDown(val: boolean): LaneGreedy;
        topDown(): boolean;
        (ordered: readonly GraphNode<unknown, unknown>[]): void;
    }

    Hierarchy (View Summary)

    • Lane<unknown, unknown>
      • LaneGreedy
    Index

    Methods

    • set whether to assign bidirectional indices

      The first node will be assigned lane zero. If bidirectional, the lanes can fan out in either direction from there, otherwise new lanes will always be added to the right.

      (default: false)

      Parameters

      • val: boolean

      Returns LaneGreedy

    • get the current bidirectional setting

      Returns boolean

    • set whether to used compressed output

      If output is compressed a free lane will be chosen over minimizing edge lengths. This can sometimes create cluttered layouts, but they will be less wide.

      (default: true)

      Parameters

      • val: boolean

      Returns LaneGreedy

    • get the current compressed setting

      Returns boolean

    • set whether the greedy assignment should be top-down or bottom-up.

      These produce slightly different results with the way the nodes are assigned.

      (default: true)

      Parameters

      • val: boolean

      Returns LaneGreedy

    • get whether the current operator is set to assign top-down..

      Returns boolean