Packages

class UnDiEdge[+N] extends HyperEdge[N] with EdgeCopy[UnDiEdge] with OuterEdge[N, UnDiEdge] with EqUnDi

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. UnDiEdge
  2. EqUnDi
  3. HyperEdge
  4. EqHyper
  5. OuterEdge
  6. EdgeParam
  7. InParam
  8. Param
  9. EdgeCopy
  10. EdgeLike
  11. Serializable
  12. Serializable
  13. Eq
  14. Iterable
  15. IterableLike
  16. Equals
  17. GenIterable
  18. GenIterableLike
  19. Traversable
  20. GenTraversable
  21. GenericTraversableTemplate
  22. TraversableLike
  23. GenTraversableLike
  24. Parallelizable
  25. TraversableOnce
  26. GenTraversableOnce
  27. FilterMonadic
  28. HasNewBuilder
  29. AnyRef
  30. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by ChainingOps
  5. by HyperEdgeAssoc
  6. by EdgeAssoc
  7. by TraversableEnrichments
  8. by any2stringadd
  9. by StringFormat
  10. by Ensuring
  11. by ArrowAssoc
  12. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new UnDiEdge(nodes: Product)

Type Members

  1. class EdgeException extends Exception
    Attributes
    protected
    Definition Classes
    EdgeLike
  2. type Self = Iterable[N]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

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 UnDiEdge[N] to any2stringadd[UnDiEdge[N]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ++[B >: N, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: N, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: N, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike
  7. def ->[B](y: B): (UnDiEdge[N], B)
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to ArrowAssoc[UnDiEdge[N]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. final def _1: N

    The first node.

    The first node. Same as _n(0).

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  10. def _2: N

    The second node.

    The second node. Same as _n(1).

    Definition Classes
    EdgeLike
  11. def _n(n: Int): N

    The n'th node with 0 <= n < arity.

    The n'th node with 0 <= n < arity.

    Definition Classes
    EdgeLike
  12. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  14. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  15. def aggregate[B](z: ⇒ B)(seqop: (B, N) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  16. final def arity: Int

    Number of nodes linked by this Edge.

    Number of nodes linked by this Edge. At least two nodes are linked. In case of a hook, the two nodes are identical. Hyperedges may link more than two nodes.

    Definition Classes
    EdgeLike
  17. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  18. def attributesToString: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  19. def baseEquals(other: EdgeLike[_]): Boolean
    Attributes
    protected
    Definition Classes
    EqUnDi → Eq
  20. def baseHashCode: Int
    Attributes
    protected
    Definition Classes
    EqUnDi → Eq
  21. def brackets: Brackets
    Attributes
    protected
    Definition Classes
    EdgeLike
  22. def canEqual(that: Any): Boolean
    Definition Classes
    EdgeLike → Eq → IterableLike → Equals
  23. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @HotSpotIntrinsicCandidate()
  24. def collect[B, That](pf: PartialFunction[N, B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  25. def collectFirst[B](pf: PartialFunction[N, B]): Option[B]
    Definition Classes
    TraversableOnce
  26. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  27. final def contains[M >: N](node: M): Boolean

    Same as isAt.

    Same as isAt.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  28. def copy[NN](newNodes: Product): UnDiEdge[NN]

    It is a prerequisite for edge-classes to implement this method.

    It is a prerequisite for edge-classes to implement this method. Otherwise they cannot be passed to a Graph.

    Graph calls this method internally to obtain a new instance of the edge passed to Graph with nodes of the type of the inner class NodeT which itself contains the outer node.

    Attributes
    protected[collection]
    Definition Classes
    UnDiEdge → HyperEdge → EdgeCopy
  29. def copyToArray[B >: N](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  30. def copyToArray[B >: N](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  31. def copyToArray[B >: N](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def copyToBuffer[B >: N](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  33. def count(p: (N) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  34. def directed: Boolean

    true if this edge is directed.

    true if this edge is directed.

    Definition Classes
    EdgeLike
  35. def drop(n: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  36. def dropRight(n: Int): Iterable[N]
    Definition Classes
    IterableLike
  37. def dropWhile(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  38. val e: EdgeLikeIn[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  39. def edge: UnDiEdge[N]
    Definition Classes
    OuterEdge
  40. def ensuring(cond: (UnDiEdge[N]) ⇒ Boolean, msg: ⇒ Any): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to Ensuring[UnDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  41. def ensuring(cond: (UnDiEdge[N]) ⇒ Boolean): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to Ensuring[UnDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  42. def ensuring(cond: Boolean, msg: ⇒ Any): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to Ensuring[UnDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  43. def ensuring(cond: Boolean): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to Ensuring[UnDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  44. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  45. def equals(other: EdgeLike[_]): 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
    EdgeLike
  46. def equals(other: Any): Boolean
    Definition Classes
    EdgeLike → Equals → AnyRef → Any
  47. def exists(p: (N) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  48. def filter(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  49. def filterNot(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  50. def find(p: (N) ⇒ Boolean): Option[N]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  51. def flatMap[B, That](f: (N) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  52. def flatten[B](implicit asTraversable: (N) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  53. def fold[A1 >: N](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  54. def foldLeft[B](z: B)(op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  55. def foldRight[B](z: B)(op: (N, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  56. def forall(p: (N) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  57. def foreach[U](f: (N) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  58. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to StringFormat[UnDiEdge[N]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  59. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  60. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  61. def groupBy[K](f: (N) ⇒ K): Map[K, Iterable[N]]
    Definition Classes
    TraversableLike → GenTraversableLike
  62. def grouped(size: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  63. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  64. 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
    HyperEdge → EdgeLike
  65. 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
    HyperEdge → EdgeLike
  66. 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
    HyperEdge → EdgeLike
  67. 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
    HyperEdge → EdgeLike
  68. def hashCode(): Int
    Definition Classes
    EdgeLike → AnyRef → Any
  69. def head: N
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  70. def headOption: Option[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  71. def init: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  72. def inits: Iterator[Iterable[N]]
    Definition Classes
    TraversableLike
  73. 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
    UnDiEdge → HyperEdge → EdgeLike
  74. 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
    UnDiEdge → HyperEdge → EdgeLike
  75. def isDefined: Boolean
    Definition Classes
    Param
  76. final def isDirected: Boolean

    Same as directed.

    Same as directed.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  77. final def isEdge: Boolean
    Definition Classes
    Param
  78. def isEmpty: Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  79. final def isHyperEdge: Boolean

    true if this is a hyperedge that is it may have more than two ends.

    true if this is a hyperedge that is it may have more than two ends.

    Definition Classes
    UnDiEdge → EdgeLike
    Annotations
    @inline()
  80. def isIn: Boolean
    Definition Classes
    InParam → Param
  81. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  82. def isLabeled: Boolean

    true if this edge is labeled.

    true if this edge is labeled. See also label.

    Definition Classes
    EdgeLike
  83. def isLooping: Boolean

    true if this edge produces a self-loop.

    true if 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 the source is equal to any of the targets. In case of an undirected hyperedge, a loop is given if any pair of incident nodes has equal nodes.

    Definition Classes
    EdgeLike
  84. def isNode: Boolean
    Definition Classes
    EdgeParam
  85. final def isOut: Boolean
    Definition Classes
    Param
  86. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  87. final def isUndirected: Boolean

    Same as undirected.

    Same as undirected.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  88. final def isValidArity(size: Int): Boolean

    A function to determine whether the arity of the passed Product of nodes (that is the number of edge ends) is valid.

    A function to determine whether the arity of the passed Product of nodes (that is the number of edge ends) is valid. This function is called on every edge-instantiation by validate that throws EdgeException if this method returns false.

    Attributes
    protected
    Definition Classes
    UnDiEdge → HyperEdge → EdgeLike
    Annotations
    @inline()
  89. def isValidCustom: Boolean

    This method may be overridden to enforce additional validation at edge creation time.

    This method may be overridden to enforce additional validation at edge creation time. Be careful to call super.isValidCustom when overriding. This function is called on every edge-instantiation by validate that throws EdgeException if this method returns false.

    Attributes
    protected
    Definition Classes
    EdgeLike
  90. def isValidCustomExceptionMessage: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  91. def iterator: Iterator[N]

    Iterator for the nodes (end-points) of this edge.

    Iterator for the nodes (end-points) of this edge.

    Definition Classes
    UnDiEdge → HyperEdge → EdgeLike → IterableLike → GenIterableLike
  92. def label: Any

    The label of this edge.

    The label of this edge. If Graph's edge type parameter has been inferred or set to a labeled edge type all contained edges are labeled. Otherwise you should assert, for instance by calling isLabeled, that the edge instance is labeled before calling this method.

    Note that label is normally not part of the edge key (hashCode). As a result, edges with different labels 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 labels you should either make use of a predefined key-labeled edge type such as LDiEdge or define a custom edge class that mixes in ExtendedKey and adds label to keyAttributes.

    Definition Classes
    EdgeLike
    Exceptions thrown

    UnsupportedOperationException if the edge is non-labeled.

  93. def last: N
    Definition Classes
    TraversableLike → GenTraversableLike
  94. def lastOption: Option[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  95. def map[B, That](f: (N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  96. 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
    UnDiEdge → HyperEdge → EdgeLike
  97. def matches[M >: N](n1: M, n2: M): Boolean

    true if
    a) both n1 and n2 are at this edge for an undirected edge
    b) n1 is a source and n2 a target of this edge for a directed edge.

    true if
    a) both n1 and n2 are at this edge for an undirected edge
    b) n1 is a source and n2 a target of this edge for a directed edge.

    Definition Classes
    UnDiEdge → HyperEdge → EdgeLike
  98. final def matches(fList: List[(N) ⇒ Boolean]): Boolean
    Attributes
    protected
    Definition Classes
    HyperEdge
  99. def max[B >: N](implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def maxBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def min[B >: N](implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def minBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. val n1: UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to EdgeAssoc[UnDiEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  107. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  108. def newBuilder: Builder[N, Iterable[N]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  109. def nodeSeq: Seq[N]

    Sequence of the end points of this edge.

    Sequence of the end points of this edge.

    Definition Classes
    EdgeLike
  110. val nodes: Product

    The end nodes joined by this edge.

    The end nodes joined by this edge.

    Nodes will typically be represented by Tuples. Alternatively subclasses of Iterable implementing Product, such as List, may also be used. In the latter case be aware of higher memory footprint.

    Definition Classes
    HyperEdge → EdgeLike
  111. def nodesToString: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  112. def nodesToStringSeparator: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  113. def nodesToStringWithParenthesis: Boolean
    Attributes
    protected
    Definition Classes
    EdgeLike
  114. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. final def nonHyperEdge: Boolean

    true if this edge has exactly two ends.

    true if this edge has exactly two ends.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  116. final def nonLooping: Boolean

    Same as ! looping.

    Same as ! looping.

    Definition Classes
    EdgeLike
  117. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  118. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  119. def par: ParIterable[N]
    Definition Classes
    Parallelizable
  120. def parCombiner: Combiner[N, ParIterable[N]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  121. def partition(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  122. def pipe[B](f: (UnDiEdge[N]) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to ChainingOps[UnDiEdge[N]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  123. def product[B >: N](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  124. def reduce[A1 >: N](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  125. def reduceLeft[B >: N](op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce
  126. def reduceLeftOption[B >: N](op: (B, N) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  127. def reduceOption[A1 >: N](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  128. def reduceRight[B >: N](op: (N, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  129. def reduceRightOption[B >: N](op: (N, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def repr: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  131. def reversed: List[N]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  132. def sameElements[B >: N](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  133. def scan[B >: N, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  134. def scanLeft[B, That](z: B)(op: (B, N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  135. def scanRight[B, That](z: B)(op: (N, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  136. val self: UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to ChainingOps[UnDiEdge[N]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  137. def seq: Iterable[N]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  138. final def size: Int
    Definition Classes
    UnDiEdge → GenTraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @inline()
  139. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  140. def slice(from: Int, until: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  141. def sliding(size: Int, step: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  142. def sliding(size: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  143. def sources: Iterable[N]

    All source ends of this edge.

    All source ends of this edge.

    Definition Classes
    HyperEdge → EdgeLike
  144. def span(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  145. def splitAt(n: Int): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  146. def stringPrefix: String
    Definition Classes
    EdgeLike → TraversableLike → GenTraversableLike
  147. def sum[B >: N](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  148. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  149. val t: UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to TraversableEnrichments[N, UnDiEdge] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  150. def tail: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  151. def tails: Iterator[Iterable[N]]
    Definition Classes
    TraversableLike
  152. def take(n: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  153. def takeRight(n: Int): Iterable[N]
    Definition Classes
    IterableLike
  154. def takeWhile(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  155. def tap[U](f: (UnDiEdge[N]) ⇒ U): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to ChainingOps[UnDiEdge[N]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  156. def targets: Iterable[N]

    All target ends of this edge.

    All target ends of this edge.

    Definition Classes
    HyperEdge → EdgeLike
  157. def thisCollection: Iterable[N]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  158. final def thisSimpleClassName: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  159. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, N, Col[N]]): Col[N]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  160. def toArray[B >: N](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  161. def toBuffer[B >: N]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  162. def toCollection(repr: Iterable[N]): Iterable[N]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  163. def toIndexedSeq: IndexedSeq[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  164. def toIterable: Iterable[N]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  165. def toIterator: Iterator[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  166. def toList: List[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  167. def toMap[T, U](implicit ev: <:<[N, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  168. def toOuterNodes[E[+X] <: EdgeLike[X]]: Seq[InParam[N, E]]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to TraversableEnrichments[N, UnDiEdge] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  169. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to CollectionsHaveToParArray[UnDiEdge[N], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (UnDiEdge[N]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  170. def toSeq: Seq[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  171. def toSet[B >: N]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  172. def toStream: Stream[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  173. def toString(): String
    Definition Classes
    EdgeLike → TraversableLike → AnyRef → Any
  174. def toStringWithParenthesis: Boolean
    Attributes
    protected
    Definition Classes
    EdgeLike
  175. def toTraversable: Traversable[N]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  176. def toVector: Vector[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  177. def transpose[B](implicit asTraversable: (N) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  178. final def unDiBaseEquals(n1: Any, n2: Any): Boolean
    Attributes
    protected
    Definition Classes
    EqUnDi
    Annotations
    @inline()
  179. final def undirected: Boolean

    true if this edge is undirected.

    true if this edge is undirected.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  180. def unzip[A1, A2](implicit asPair: (N) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  181. def unzip3[A1, A2, A3](implicit asTriple: (N) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  182. final def validate: Unit

    Performs basic, inevitable edge validation.

    Performs basic, inevitable edge validation. Among others, ensures that nodes ne null and no edge end eq null.

    This validation method must be called in the constructor of any edge class that directly extends or mixes in EdgeLike. To perform additional custom validation isValidCustom is to be overridden.

    Attributes
    protected
    Definition Classes
    EdgeLike
    Exceptions thrown

    EdgeException if any of the basic validations or of eventually supplied additional validations fails.

  183. val value: UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to OuterNode[UnDiEdge[N]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  184. def view(from: Int, until: Int): IterableView[N, Iterable[N]]
    Definition Classes
    IterableLike → TraversableLike
  185. def view: IterableView[N, Iterable[N]]
    Definition Classes
    IterableLike → TraversableLike
  186. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  187. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  188. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  189. 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 either make use of a predefined key-weighted edge type such as WDiEdge or define a custom edge class that mixes in ExtendedKey and adds weight to keyAttributes.

    Definition Classes
    EdgeLike
  190. def withFilter(p: (N) ⇒ Boolean): FilterMonadic[N, Iterable[N]]
    Definition Classes
    TraversableLike → FilterMonadic
  191. 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
    UnDiEdge → HyperEdge → EdgeLike
  192. 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
    UnDiEdge → HyperEdge → EdgeLike
  193. def zip[A1 >: N, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[N], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  194. def zipAll[B, A1 >: N, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[N], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  195. def zipWithIndex[A1 >: N, That](implicit bf: CanBuildFrom[Iterable[N], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  196. def ~[N >: NOld](n: N)(implicit endpointsKind: CollectionKind = Bag): HyperEdge[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  197. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to EdgeAssoc[UnDiEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  198. def ~>[N >: NOld](n: N)(implicit targetsKind: CollectionKind = Bag): DiHyperEdge[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  199. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to EdgeAssoc[UnDiEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  200. def →[B](y: B): (UnDiEdge[N], B)
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to ArrowAssoc[UnDiEdge[N]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def filter(p: (N) ⇒ Boolean): TraversableOnce[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to MonadOps[N] performed by method MonadOps in scala.collection.TraversableOnce.
    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:
    (unDiEdge: MonadOps[N]).filter(p)
    Definition Classes
    MonadOps
  2. def flatMap[B](f: (N) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to MonadOps[N] performed by method MonadOps in scala.collection.TraversableOnce.
    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:
    (unDiEdge: MonadOps[N]).flatMap(f)
    Definition Classes
    MonadOps
  3. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to OuterNode[UnDiEdge[N]] performed by method anyToNode in scalax.collection.GraphPredef.
    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:
    (unDiEdge: OuterNode[UnDiEdge[N]]).isDefined
    Definition Classes
    Param
  4. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to OuterNode[UnDiEdge[N]] performed by method anyToNode in scalax.collection.GraphPredef.
    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:
    (unDiEdge: OuterNode[UnDiEdge[N]]).isEdge
    Definition Classes
    Param
  5. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to OuterNode[UnDiEdge[N]] performed by method anyToNode in scalax.collection.GraphPredef.
    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:
    (unDiEdge: OuterNode[UnDiEdge[N]]).isIn
    Definition Classes
    InParam → Param
  6. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to OuterNode[UnDiEdge[N]] performed by method anyToNode in scalax.collection.GraphPredef.
    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:
    (unDiEdge: OuterNode[UnDiEdge[N]]).isNode
    Definition Classes
    NodeParam
  7. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to OuterNode[UnDiEdge[N]] performed by method anyToNode in scalax.collection.GraphPredef.
    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:
    (unDiEdge: OuterNode[UnDiEdge[N]]).isOut
    Definition Classes
    Param
  8. def map[B](f: (N) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to MonadOps[N] performed by method MonadOps in scala.collection.TraversableOnce.
    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:
    (unDiEdge: MonadOps[N]).map(f)
    Definition Classes
    MonadOps
  9. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to OuterNode[UnDiEdge[N]] performed by method anyToNode in scalax.collection.GraphPredef.
    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:
    (unDiEdge: OuterNode[UnDiEdge[N]]).stringPrefix
    Definition Classes
    NodeParam
  10. def toString(): String
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to OuterNode[UnDiEdge[N]] performed by method anyToNode in scalax.collection.GraphPredef.
    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:
    (unDiEdge: OuterNode[UnDiEdge[N]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  11. def withFilter(p: (N) ⇒ Boolean): Iterator[N]
    Implicit
    This member is added by an implicit conversion from UnDiEdge[N] to MonadOps[N] performed by method MonadOps in scala.collection.TraversableOnce.
    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:
    (unDiEdge: MonadOps[N]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: (N, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

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

    (Since version ) see corresponding Javadoc for more information.

Inherited from EqUnDi

Inherited from HyperEdge[N]

Inherited from EqHyper

Inherited from OuterEdge[N, UnDiEdge]

Inherited from EdgeParam

Inherited from InParam[N, UnDiEdge]

Inherited from Param[N, UnDiEdge]

Inherited from EdgeCopy[UnDiEdge]

Inherited from EdgeLike[N]

Inherited from Serializable

Inherited from Serializable

Inherited from Eq

Inherited from Iterable[N]

Inherited from IterableLike[N, Iterable[N]]

Inherited from Equals

Inherited from GenIterable[N]

Inherited from GenIterableLike[N, Iterable[N]]

Inherited from Traversable[N]

Inherited from GenTraversable[N]

Inherited from GenericTraversableTemplate[N, Iterable]

Inherited from TraversableLike[N, Iterable[N]]

Inherited from GenTraversableLike[N, Iterable[N]]

Inherited from Parallelizable[N, ParIterable[N]]

Inherited from TraversableOnce[N]

Inherited from GenTraversableOnce[N]

Inherited from FilterMonadic[N, Iterable[N]]

Inherited from HasNewBuilder[N, Iterable[N]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from UnDiEdge[N] to OuterNode[UnDiEdge[N]]

Inherited by implicit conversion CollectionsHaveToParArray from UnDiEdge[N] to CollectionsHaveToParArray[UnDiEdge[N], T]

Inherited by implicit conversion MonadOps from UnDiEdge[N] to MonadOps[N]

Inherited by implicit conversion ChainingOps from UnDiEdge[N] to ChainingOps[UnDiEdge[N]]

Inherited by implicit conversion HyperEdgeAssoc from UnDiEdge[N] to HyperEdgeAssoc[N]

Inherited by implicit conversion EdgeAssoc from UnDiEdge[N] to EdgeAssoc[UnDiEdge[N]]

Inherited by implicit conversion TraversableEnrichments from UnDiEdge[N] to TraversableEnrichments[N, UnDiEdge]

Inherited by implicit conversion any2stringadd from UnDiEdge[N] to any2stringadd[UnDiEdge[N]]

Inherited by implicit conversion StringFormat from UnDiEdge[N] to StringFormat[UnDiEdge[N]]

Inherited by implicit conversion Ensuring from UnDiEdge[N] to Ensuring[UnDiEdge[N]]

Inherited by implicit conversion ArrowAssoc from UnDiEdge[N] to ArrowAssoc[UnDiEdge[N]]

Inherited by implicit conversion alternateImplicit from UnDiEdge[N] to ForceImplicitAmbiguity

Ungrouped