Packages

abstract class LUnDiEdge[+N, L] extends AnyUnDiEdge[N] with SingleLabel[L] with ExtendedKeyBySingleLabel with LUnDiEdgeToString with MultiLEdgeToString

Template for generic undirected multiedges with a single label field. To support multigraphs, equality is based on the nodes and the label field. Mix in GenericEdgeMapper to get your derived edge also mappable.

Linear Supertypes
MultiLEdgeToString, LUnDiEdgeToString, UnDiEdgeToString, LEdgeToString, EdgeToString, ExtendedKeyBySingleLabel, MultiEdge, SingleLabel[L], AnyUnDiEdge[N], EqUnDi[N], AnyEdge[N], AnyHyperEdge[N], EqHyper, Eq, Edge[N], Equals, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LUnDiEdge
  2. MultiLEdgeToString
  3. LUnDiEdgeToString
  4. UnDiEdgeToString
  5. LEdgeToString
  6. EdgeToString
  7. ExtendedKeyBySingleLabel
  8. MultiEdge
  9. SingleLabel
  10. AnyUnDiEdge
  11. EqUnDi
  12. AnyEdge
  13. AnyHyperEdge
  14. EqHyper
  15. Eq
  16. Edge
  17. Equals
  18. AnyRef
  19. Any
Implicitly
  1. by StringFormat
  2. by Ensuring
  3. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new LUnDiEdge()

Abstract Value Members

  1. abstract def label: L
    Definition Classes
    SingleLabel
  2. abstract def source: N
    Definition Classes
    AnyUnDiEdge
  3. abstract def target: N
    Definition Classes
    AnyUnDiEdge

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def ->[B](y: B): (LUnDiEdge[N, L], B)
    Implicit
    This member is added by an implicit conversion from LUnDiEdge[N, L] toArrowAssoc[LUnDiEdge[N, L]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  4. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  5. final def arity: Int

    Number of the endpoints of this edge.

    Number of the endpoints of this edge. At least two nodes are joined. In case of a hook, the two nodes are identical. Hyperedges may link more than two nodes.

    Definition Classes
    AnyEdge → Edge
    Annotations
    @inline()
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def baseEquals(other: Edge[_]): Boolean
    Attributes
    protected
    Definition Classes
    EqUnDi → Eq
  8. def baseHashCode: Int
    Attributes
    protected
    Definition Classes
    EqUnDi → Eq
  9. def canEqual(that: Any): Boolean
    Definition Classes
    Edge → Equals
  10. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @IntrinsicCandidate() @native()
  11. final def contains[M >: N](node: M): Boolean

    Same as isAt.

    Same as isAt.

    Definition Classes
    Edge
    Annotations
    @inline()
  12. def customMsgPrefix: String
    Attributes
    protected
    Definition Classes
    Edge
  13. def ends: Several[N]

    The endpoints of this edge, in other words the nodes this edge connects.

    The endpoints of this edge, in other words the nodes this edge connects.

    Definition Classes
    AnyEdge → Edge
  14. def ensuring(cond: (LUnDiEdge[N, L]) => Boolean, msg: => Any): LUnDiEdge[N, L]
    Implicit
    This member is added by an implicit conversion from LUnDiEdge[N, L] toEnsuring[LUnDiEdge[N, L]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  15. def ensuring(cond: (LUnDiEdge[N, L]) => Boolean): LUnDiEdge[N, L]
    Implicit
    This member is added by an implicit conversion from LUnDiEdge[N, L] toEnsuring[LUnDiEdge[N, L]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  16. def ensuring(cond: Boolean, msg: => Any): LUnDiEdge[N, L]
    Implicit
    This member is added by an implicit conversion from LUnDiEdge[N, L] toEnsuring[LUnDiEdge[N, L]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  17. def ensuring(cond: Boolean): LUnDiEdge[N, L]
    Implicit
    This member is added by an implicit conversion from LUnDiEdge[N, L] toEnsuring[LUnDiEdge[N, L]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  18. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. def equals(other: Any): Boolean
    Definition Classes
    MultiEdge → Eq → AnyRef → Any
  20. def equals(other: Edge[_]): Boolean

    Preconditions: this.directed == that.directed && this.isInstanceOf[Keyed] == that.isInstanceOf[Keyed]

    Preconditions: this.directed == that.directed && this.isInstanceOf[Keyed] == that.isInstanceOf[Keyed]

    Attributes
    protected
    Definition Classes
    Eq
  21. def extendKeyBy: OneOrMore[Any]

    Each value, such as a class member, you specify in this non-empty sequence will be added to the edge "key" which contains the edge ends, in terms of a directed edge the source and the target, by default.

    Each value, such as a class member, you specify in this non-empty sequence will be added to the edge "key" which contains the edge ends, in terms of a directed edge the source and the target, by default. The term "key" refers to how equality of edges is controlled.

    Definition Classes
    ExtendedKeyBySingleLabel → MultiEdge
  22. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @IntrinsicCandidate() @native()
  23. final def hasSource(pred: (N) => Boolean): Boolean

    true if any source end of this edge fulfills pred.

    true if any source end of this edge fulfills pred.

    Definition Classes
    AnyUnDiEdge → AnyHyperEdge → Edge
  24. final def hasSource[M >: N](node: M): Boolean

    true if node is a source of this edge.

    true if node is a source of this edge. In case this edge is undirected this method maps to isAt.

    Definition Classes
    AnyUnDiEdge → AnyHyperEdge → Edge
  25. final def hasTarget(pred: (N) => Boolean): Boolean

    true if any target end of this edge fulfills pred.

    true if any target end of this edge fulfills pred.

    Definition Classes
    AnyUnDiEdge → AnyHyperEdge → Edge
  26. final def hasTarget[M >: N](node: M): Boolean

    true if node is a target of this edge.

    true if node is a target of this edge. In case this edge is undirected this method maps to isAt.

    Definition Classes
    AnyUnDiEdge → AnyHyperEdge → Edge
  27. def hashCode(): Int
    Definition Classes
    MultiEdge → Eq → AnyRef → Any
  28. final def isAt(pred: (N) => Boolean): Boolean

    true if any end of this edge fulfills pred.

    true if any end of this edge fulfills pred.

    Definition Classes
    AnyEdge → Edge
    Annotations
    @inline()
  29. final def isAt[M >: N](node: M): Boolean

    true if node is incident with this edge.

    true if node is incident with this edge.

    Definition Classes
    AnyEdge → Edge
    Annotations
    @inline()
  30. def isDirected: Boolean

    Whether this edge is directed.

    Whether this edge is directed.

    Definition Classes
    AnyUnDiEdge → AnyHyperEdge → Edge
  31. final def isHyperEdge: Boolean

    Whether this edge's type is hyperedge meaning that it may have more than two ends.

    Whether this edge's type is hyperedge meaning that it may have more than two ends.

    Definition Classes
    AnyEdge → Edge
    Annotations
    @inline()
  32. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  33. def isLabeled: Boolean
    Definition Classes
    Edge
  34. final def isLooping: Boolean

    Whether this edge produces a self-loop.

    Whether this edge produces a self-loop. In case of a non-hyperedge, a loop is given if the incident nodes are equal. In case of a directed hyperedge, a loop is given if any of the targets is included in the sources. In case of an undirected hyperedge, a loop is given if any of the ends is a duplicate.

    Definition Classes
    AnyUnDiEdge → AnyEdge → AnyHyperEdge → Edge
  35. final def isUndirected: Boolean

    Whether this edge is undirected.

    Whether this edge is undirected.

    Definition Classes
    Edge
    Annotations
    @inline()
  36. def labelSeparator: String
    Attributes
    protected
    Definition Classes
    MultiLEdgeToString
  37. def labelToString: String
    Attributes
    protected
    Definition Classes
    SingleLabel
  38. def matches(p1: (N) => Boolean, p2: (N) => Boolean): Boolean

    true if
    a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
    b) p1 holds for a source and p2 for a target of this directed edge.

    true if
    a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
    b) p1 holds for a source and p2 for a target of this directed edge.

    Definition Classes
    AnyUnDiEdge → AnyHyperEdge → Edge
  39. def matches[M >: N](n1: M, n2: M): Boolean

    true if

    true if

    1. being an undirected edge, both n1 and n2 are at this edge
    2. being a directed edge, n1 is a source and n2 a target of this edge.
    Definition Classes
    AnyUnDiEdge → AnyHyperEdge → Edge
  40. final def matches(fList: List[(N) => Boolean]): Boolean
    Attributes
    protected
    Definition Classes
    AnyHyperEdge
  41. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  42. final def node(n: Int): N

    The n'th node of this edge.

    The n'th node of this edge.

    Definition Classes
    AnyEdge → Edge
    Exceptions thrown

    IllegalArgumentException if n does not meet 0 <= n < arity.

  43. final def node1: N

    The first node of this edge.

    The first node of this edge.

    Definition Classes
    AnyUnDiEdge → AnyHyperEdge → Edge
    Annotations
    @inline()
  44. final def node2: N

    The second node of this edge.

    The second node of this edge.

    Definition Classes
    AnyUnDiEdge → AnyHyperEdge → Edge
    Annotations
    @inline()
  45. def nodesToString: String
    Attributes
    protected
    Definition Classes
    EdgeToString
  46. def nodesToStringSeparator: String
    Attributes
    protected
    Definition Classes
    UnDiEdgeToString → EdgeToString
  47. final def nonHyperEdge: Boolean

    Whether this edge has exactly two ends.

    Whether this edge has exactly two ends.

    Definition Classes
    Edge
    Annotations
    @inline()
  48. final def nonLooping: Boolean

    Same as ! isLooping.

    Same as ! isLooping.

    Definition Classes
    Edge
    Annotations
    @inline()
  49. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @IntrinsicCandidate() @native()
  50. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @IntrinsicCandidate() @native()
  51. final def sources: OneOrMore[N]

    All source ends of this edge.

    All source ends of this edge.

    Definition Classes
    AnyUnDiEdge → AnyHyperEdge → Edge
    Annotations
    @inline()
  52. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  53. final def targets: OneOrMore[N]

    All target ends of this edge.

    All target ends of this edge.

    Definition Classes
    AnyUnDiEdge → AnyHyperEdge → Edge
    Annotations
    @inline()
  54. def toString(): String

    Implemented in terms of the protected methods nodesToString, labelSeparator and labelToString.

    Implemented in terms of the protected methods nodesToString, labelSeparator and labelToString.

    Definition Classes
    LEdgeToString → EdgeToString → AnyRef → Any
  55. final def unDiBaseEquals(n1: Any, n2: Any): Boolean
    Attributes
    protected
    Definition Classes
    EqUnDi
    Annotations
    @inline()
  56. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  57. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  58. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  59. def weight: Double

    The weight of this edge with a default of 1.

    The weight of this edge with a default of 1.

    Note that weight is normally not part of the edge key (hashCode). As a result, edges with different weights connecting the same nodes will be evaluated as equal and thus added once and only once to the graph. In case you need multi-edges based on different weights you should define a custom edge class that mixes in ExtendedKey and adds weight to keyAttributes.

    Definition Classes
    Edge
  60. final def withSources[U](f: (N) => U): Unit

    Applies f to all source ends of this edge without any memory allocation.

    Applies f to all source ends of this edge without any memory allocation.

    Definition Classes
    AnyUnDiEdge → AnyHyperEdge → Edge
  61. final def withTargets[U](f: (N) => U): Unit

    Applies f to the target ends of this edge without any memory allocation.

    Applies f to the target ends of this edge without any memory allocation.

    Definition Classes
    AnyUnDiEdge → AnyHyperEdge → Edge

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

    (Since version 9)

  2. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from LUnDiEdge[N, L] toStringFormat[LUnDiEdge[N, L]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.

  3. def →[B](y: B): (LUnDiEdge[N, L], B)
    Implicit
    This member is added by an implicit conversion from LUnDiEdge[N, L] toArrowAssoc[LUnDiEdge[N, L]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from MultiLEdgeToString

Inherited from LUnDiEdgeToString

Inherited from UnDiEdgeToString

Inherited from LEdgeToString

Inherited from EdgeToString

Inherited from ExtendedKeyBySingleLabel

Inherited from MultiEdge

Inherited from SingleLabel[L]

Inherited from AnyUnDiEdge[N]

Inherited from EqUnDi[N]

Inherited from AnyEdge[N]

Inherited from AnyHyperEdge[N]

Inherited from EqHyper

Inherited from Eq

Inherited from Edge[N]

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion StringFormat fromLUnDiEdge[N, L] to StringFormat[LUnDiEdge[N, L]]

Inherited by implicit conversion Ensuring fromLUnDiEdge[N, L] to Ensuring[LUnDiEdge[N, L]]

Inherited by implicit conversion ArrowAssoc fromLUnDiEdge[N, L] to ArrowAssoc[LUnDiEdge[N, L]]

Ungrouped