Packages

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

Template for generic undirected edges with a single label field. Equality is based solely on the nodes so this trait is not suitable for multigraphs. Mix in GenericEdgeMapper to get your derived edge also mappable.

Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LUnDiEdge
  2. LUnDiEdgeToString
  3. UnDiEdgeToString
  4. LEdgeToString
  5. EdgeToString
  6. SingleLabel
  7. AnyUnDiEdge
  8. EqUnDi
  9. AnyEdge
  10. AnyHyperEdge
  11. EqHyper
  12. Eq
  13. Edge
  14. Equals
  15. AnyRef
  16. Any
Implicitly
  1. by DiEdgeImplicits
  2. by UnDiEdgeImplicits
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. 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 +(other: String): String
    Implicit
    This member is added by an implicit conversion from LUnDiEdge[N, L] toany2stringadd[LUnDiEdge[N, L]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. 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()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. final def _1: N

    The first node of this edge.

    The first node of this edge.

    Definition Classes
    AnyUnDiEdgeAnyHyperEdgeEdge
    Annotations
    @inline()
  7. final def _2: N

    The second node of this edge.

    The second node of this edge.

    Definition Classes
    AnyUnDiEdgeAnyHyperEdgeEdge
    Annotations
    @inline()
  8. 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
    AnyEdgeEdge
    Annotations
    @inline()
  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. def baseEquals(other: Edge[_]): Boolean
    Attributes
    protected
    Definition Classes
    EqUnDiEq
  11. def baseHashCode: Int
    Attributes
    protected
    Definition Classes
    EqUnDiEq
  12. def canEqual(that: Any): Boolean
    Definition Classes
    Edge → Equals
  13. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  14. final def contains[M >: N](node: M): Boolean

    Same as isAt.

    Same as isAt.

    Definition Classes
    Edge
    Annotations
    @inline()
  15. def customMsgPrefix: String
    Attributes
    protected
    Definition Classes
    Edge
  16. 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
    AnyEdgeEdge
  17. 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
  18. 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
  19. 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
  20. 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
  21. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. 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
  23. def equals(other: Any): Boolean
    Definition Classes
    Eq → AnyRef → Any
  24. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  25. 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
    AnyUnDiEdgeAnyHyperEdgeEdge
  26. 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
    AnyUnDiEdgeAnyHyperEdgeEdge
  27. 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
    AnyUnDiEdgeAnyHyperEdgeEdge
  28. 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
    AnyUnDiEdgeAnyHyperEdgeEdge
  29. def hashCode(): Int
    Definition Classes
    Eq → AnyRef → Any
  30. 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
    AnyEdgeEdge
    Annotations
    @inline()
  31. 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
    AnyEdgeEdge
    Annotations
    @inline()
  32. def isDirected: Boolean

    Whether this edge is directed.

    Whether this edge is directed.

    Definition Classes
    AnyUnDiEdgeAnyHyperEdgeEdge
  33. 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
    AnyEdgeEdge
    Annotations
    @inline()
  34. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  35. def isLabeled: Boolean
    Definition Classes
    Edge
  36. 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
    AnyUnDiEdgeAnyEdgeAnyHyperEdgeEdge
  37. final def isUndirected: Boolean

    Whether this edge is undirected.

    Whether this edge is undirected.

    Definition Classes
    Edge
    Annotations
    @inline()
  38. def labelSeparator: String

    The part to be printed after the edge ends and before the label.

    The part to be printed after the edge ends and before the label.

    Attributes
    protected
    Definition Classes
    LEdgeToString
  39. def labelToString: String
    Attributes
    protected
    Definition Classes
    SingleLabel
  40. 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
    AnyUnDiEdgeAnyHyperEdgeEdge
  41. 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
    AnyUnDiEdgeAnyHyperEdgeEdge
  42. final def matches(fList: List[(N) => Boolean]): Boolean
    Attributes
    protected
    Definition Classes
    AnyHyperEdge
  43. val n1: LUnDiEdge[N, L]
    Implicit
    This member is added by an implicit conversion from LUnDiEdge[N, L] toUnDiEdgeImplicits[LUnDiEdge[N, L]] performed by method UnDiEdgeImplicits in scalax.collection.edges.
    Definition Classes
    UnDiEdgeImplicitsAbstractEdgeImplicits
  44. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  45. final def node(n: Int): N

    The n'th node of this edge.

    The n'th node of this edge.

    Definition Classes
    AnyEdgeEdge
    Exceptions thrown

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

  46. def nodesToString: String
    Attributes
    protected
    Definition Classes
    EdgeToString
  47. def nodesToStringSeparator: String
    Attributes
    protected
    Definition Classes
    UnDiEdgeToStringEdgeToString
  48. final def nonHyperEdge: Boolean

    Whether this edge has exactly two ends.

    Whether this edge has exactly two ends.

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

    Same as ! looping.

    Same as ! looping.

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

    All source ends of this edge.

    All source ends of this edge.

    Definition Classes
    AnyUnDiEdgeAnyHyperEdgeEdge
    Annotations
    @inline()
  53. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  54. final def targets: OneOrMore[N]

    All target ends of this edge.

    All target ends of this edge.

    Definition Classes
    AnyUnDiEdgeAnyHyperEdgeEdge
    Annotations
    @inline()
  55. 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
    LEdgeToStringEdgeToString → AnyRef → Any
  56. final def unDiBaseEquals(n1: Any, n2: Any): Boolean
    Attributes
    protected
    Definition Classes
    EqUnDi
    Annotations
    @inline()
  57. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  58. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  59. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  60. 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
  61. 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
    AnyUnDiEdgeAnyHyperEdgeEdge
  62. 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
    AnyUnDiEdgeAnyHyperEdgeEdge
  63. def ~[NN >: N](n2: NN): UnDiEdge[NN]
    Implicit
    This member is added by an implicit conversion from LUnDiEdge[N, L] toUnDiEdgeImplicits[LUnDiEdge[N, L]] performed by method UnDiEdgeImplicits in scalax.collection.edges.
    Definition Classes
    AbstractEdgeImplicits
  64. def ~>[NN >: N](target: NN): DiEdge[NN]
    Implicit
    This member is added by an implicit conversion from LUnDiEdge[N, L] toDiEdgeImplicits[LUnDiEdge[N, L]] performed by method DiEdgeImplicits in scalax.collection.edges.
    Definition Classes
    AbstractDiEdgeImplicits

Shadowed Implicit Value Members

  1. val source: LUnDiEdge[N, L]
    Implicit
    This member is added by an implicit conversion from LUnDiEdge[N, L] toDiEdgeImplicits[LUnDiEdge[N, L]] performed by method DiEdgeImplicits in scalax.collection.edges.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (lUnDiEdge: DiEdgeImplicits[LUnDiEdge[N, L]]).source
    Definition Classes
    DiEdgeImplicitsAbstractDiEdgeImplicits

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  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 LUnDiEdgeToString

Inherited from UnDiEdgeToString

Inherited from LEdgeToString

Inherited from EdgeToString

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 DiEdgeImplicits fromLUnDiEdge[N, L] to DiEdgeImplicits[LUnDiEdge[N, L]]

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

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

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