SPeCS Packages Documentation
    Preparing search index...

    An edge statement in a dot graph.

    For simplicity, shorthands like n1 -> n2 -> n3 or {n1; n2} -> {n3; n4} are not supported. Instead, you must create an edge for each pair of nodes.

    Implements

    Index

    Constructors

    Properties

    Methods

    Constructors

    Properties

    attrList: Record<string, string>

    The list of attributes of the edge.

    The ID of the source node of the edge.

    The ID of the target node of the edge.

    Methods

    • Adds an attribute to the attribute list of the edge.

      Parameters

      • key: string

        The key of the attribute.

      • value: string

        The value of the attribute.

      Returns this

      This edge statement, for chaining.

    • Adds multiple attributes to the attribute list of the edge.

      Parameters

      • attrs: Record<string, string>

        The attributes to add.

      Returns this

      This edge statement, for chaining.

    • Converts the edge statement to a dot string.

      Parameters

      • directed: boolean

        Whether the graph is directed.

      • indentation: number = 0

        The number of spaces to indent.

      Returns string

      The dot string of the edge statement.