Packages

sealed trait EdgeLike[+N] extends Iterable[N] with Eq with Serializable

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EdgeLike
  2. Serializable
  3. Serializable
  4. Eq
  5. Iterable
  6. IterableLike
  7. Equals
  8. GenIterable
  9. GenIterableLike
  10. Traversable
  11. GenTraversable
  12. GenericTraversableTemplate
  13. TraversableLike
  14. GenTraversableLike
  15. Parallelizable
  16. TraversableOnce
  17. GenTraversableOnce
  18. FilterMonadic
  19. HasNewBuilder
  20. AnyRef
  21. Any
Implicitly
  1. by CollectionsHaveToParArray
  2. by MonadOps
  3. by ChainingOps
  4. by any2stringadd
  5. by StringFormat
  6. by Ensuring
  7. by ArrowAssoc
  8. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

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

Abstract Value Members

  1. abstract def baseEquals(other: EdgeLike[_]): Boolean
    Attributes
    protected
    Definition Classes
    Eq
  2. abstract def baseHashCode: Int
    Attributes
    protected
    Definition Classes
    Eq
  3. abstract def hasSource(pred: (N) ⇒ Boolean): Boolean

    true if any source end of this edge fulfills pred.

  4. abstract 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.

  5. abstract def hasTarget(pred: (N) ⇒ Boolean): Boolean

    true if any target end of this edge fulfills pred.

  6. abstract 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.

  7. abstract def isAt(pred: (N) ⇒ Boolean): Boolean

    true if any end of this edge fulfills pred.

  8. abstract def isAt[M >: N](node: M): Boolean

    true if node is incident with this edge.

  9. abstract 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
  10. abstract def iterator: Iterator[N]

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

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

    Definition Classes
    EdgeLike → IterableLike → GenIterableLike
  11. abstract 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.

  12. abstract 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.

  13. abstract def 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.

  14. abstract def sources: Iterable[N]

    All source ends of this edge.

  15. abstract def targets: Iterable[N]

    All target ends of this edge.

  16. abstract def withSources[U](f: (N) ⇒ U): Unit

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

  17. abstract def withTargets[U](f: (N) ⇒ U): Unit

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

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 EdgeLike[N] to any2stringadd[EdgeLike[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): (EdgeLike[N], B)
    Implicit
    This member is added by an implicit conversion from EdgeLike[N] to ArrowAssoc[EdgeLike[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).

    Annotations
    @inline()
  10. def _2: N

    The second node.

    The second node. Same as _n(1).

  11. def _n(n: Int): N

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

  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.

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

    Same as isAt.

    Same as isAt.

    Annotations
    @inline()
  26. def copyToArray[B >: N](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  27. def copyToArray[B >: N](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  28. def copyToArray[B >: N](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  29. def copyToBuffer[B >: N](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  30. def count(p: (N) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  31. def directed: Boolean

    true if this edge is directed.

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

    Same as directed.

    Same as directed.

    Annotations
    @inline()
  65. def isEmpty: Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  66. def isHyperEdge: Boolean

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

  67. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  68. def isLabeled: Boolean

    true if this edge is labeled.

    true if this edge is labeled. See also label.

  69. 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.

  70. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  71. final def isUndirected: Boolean

    Same as undirected.

    Same as undirected.

    Annotations
    @inline()
  72. 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
  73. def isValidCustomExceptionMessage: String
    Attributes
    protected
  74. 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.

    Exceptions thrown

    UnsupportedOperationException if the edge is non-labeled.

  75. def last: N
    Definition Classes
    TraversableLike → GenTraversableLike
  76. def lastOption: Option[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  77. def map[B, That](f: (N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  78. def max[B >: N](implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. def maxBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  80. def min[B >: N](implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  81. def minBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  82. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  83. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  86. def newBuilder: Builder[N, Iterable[N]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  87. def nodeSeq: Seq[N]

    Sequence of the end points of this edge.

  88. def nodesToString: String
    Attributes
    protected
  89. def nodesToStringSeparator: String
    Attributes
    protected
  90. def nodesToStringWithParenthesis: Boolean
    Attributes
    protected
  91. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. final def nonHyperEdge: Boolean

    true if this edge has exactly two ends.

    true if this edge has exactly two ends.

    Annotations
    @inline()
  93. final def nonLooping: Boolean

    Same as ! looping.

  94. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  95. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  96. def par: ParIterable[N]
    Definition Classes
    Parallelizable
  97. def parCombiner: Combiner[N, ParIterable[N]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  98. def partition(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  99. def pipe[B](f: (EdgeLike[N]) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from EdgeLike[N] to ChainingOps[EdgeLike[N]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  100. def product[B >: N](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def reduce[A1 >: N](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def reduceLeft[B >: N](op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce
  103. def reduceLeftOption[B >: N](op: (B, N) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def reduceOption[A1 >: N](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def reduceRight[B >: N](op: (N, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  106. def reduceRightOption[B >: N](op: (N, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def repr: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def reversed: List[N]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  109. def sameElements[B >: N](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  110. def scan[B >: N, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  111. def scanLeft[B, That](z: B)(op: (B, N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  112. 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.

  113. val self: EdgeLike[N]
    Implicit
    This member is added by an implicit conversion from EdgeLike[N] to ChainingOps[EdgeLike[N]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  114. def seq: Iterable[N]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  115. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  117. def slice(from: Int, until: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  118. def sliding(size: Int, step: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  119. def sliding(size: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  120. def span(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  121. def splitAt(n: Int): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  122. def stringPrefix: String
    Definition Classes
    EdgeLike → TraversableLike → GenTraversableLike
  123. def sum[B >: N](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  124. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  125. def tail: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  126. def tails: Iterator[Iterable[N]]
    Definition Classes
    TraversableLike
  127. def take(n: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  128. def takeRight(n: Int): Iterable[N]
    Definition Classes
    IterableLike
  129. def takeWhile(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  130. def tap[U](f: (EdgeLike[N]) ⇒ U): EdgeLike[N]
    Implicit
    This member is added by an implicit conversion from EdgeLike[N] to ChainingOps[EdgeLike[N]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  131. def thisCollection: Iterable[N]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  132. final def thisSimpleClassName: String
    Attributes
    protected
  133. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, N, Col[N]]): Col[N]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  134. def toArray[B >: N](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def toBuffer[B >: N]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def toCollection(repr: Iterable[N]): Iterable[N]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  137. def toIndexedSeq: IndexedSeq[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def toIterable: Iterable[N]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  139. def toIterator: Iterator[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  140. def toList: List[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  141. def toMap[T, U](implicit ev: <:<[N, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  142. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from EdgeLike[N] to CollectionsHaveToParArray[EdgeLike[N], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (EdgeLike[N]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  143. def toSeq: Seq[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def toSet[B >: N]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. def toStream: Stream[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  146. def toString(): String
    Definition Classes
    EdgeLike → TraversableLike → AnyRef → Any
  147. def toStringWithParenthesis: Boolean
    Attributes
    protected
  148. def toTraversable: Traversable[N]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  149. def toVector: Vector[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  150. 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.

  151. final def undirected: Boolean

    true if this edge is undirected.

    true if this edge is undirected.

    Annotations
    @inline()
  152. def unzip[A1, A2](implicit asPair: (N) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  153. def unzip3[A1, A2, A3](implicit asTriple: (N) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  154. 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
    Exceptions thrown

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

  155. def view(from: Int, until: Int): IterableView[N, Iterable[N]]
    Definition Classes
    IterableLike → TraversableLike
  156. def view: IterableView[N, Iterable[N]]
    Definition Classes
    IterableLike → TraversableLike
  157. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  158. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  159. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  160. 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.

  161. def withFilter(p: (N) ⇒ Boolean): FilterMonadic[N, Iterable[N]]
    Definition Classes
    TraversableLike → FilterMonadic
  162. def zip[A1 >: N, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[N], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  163. 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
  164. def zipWithIndex[A1 >: N, That](implicit bf: CanBuildFrom[Iterable[N], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  165. def →[B](y: B): (EdgeLike[N], B)
    Implicit
    This member is added by an implicit conversion from EdgeLike[N] to ArrowAssoc[EdgeLike[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 EdgeLike[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:
    (edgeLike: 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 EdgeLike[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:
    (edgeLike: MonadOps[N]).flatMap(f)
    Definition Classes
    MonadOps
  3. def map[B](f: (N) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from EdgeLike[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:
    (edgeLike: MonadOps[N]).map(f)
    Definition Classes
    MonadOps
  4. def withFilter(p: (N) ⇒ Boolean): Iterator[N]
    Implicit
    This member is added by an implicit conversion from EdgeLike[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:
    (edgeLike: 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 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] @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyRef

Inherited from Any

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

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

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

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

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

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

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

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

Ungrouped