Packages

trait LoopFreeEdge[+N] extends EdgeLike[N]

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

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

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.

    true if any source end of this edge fulfills pred.

    Definition Classes
    EdgeLike
  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.

    Definition Classes
    EdgeLike
  5. abstract 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
    EdgeLike
  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.

    Definition Classes
    EdgeLike
  7. abstract 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
    EdgeLike
  8. abstract 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
    EdgeLike
  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
    Definition Classes
    EdgeLike
  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.

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

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

    Definition Classes
    EdgeLike
  14. abstract def withSources[U](f: (N) ⇒ U): Unit

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

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

    Definition Classes
    EdgeLike
  15. abstract def withTargets[U](f: (N) ⇒ U): Unit

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

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

    Definition Classes
    EdgeLike

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 LoopFreeEdge[N] to any2stringadd[LoopFreeEdge[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): (LoopFreeEdge[N], B)
    Implicit
    This member is added by an implicit conversion from LoopFreeEdge[N] to ArrowAssoc[LoopFreeEdge[N]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. def /:[B](z: B)(op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. def :\[B](z: B)(op: (N, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. final def _1: N

    The first node.

    The first node. Same as _n(0).

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

    The second node.

    The second node. Same as _n(1).

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

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

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

    Definition Classes
    EdgeLike
  14. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  15. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  16. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  17. def aggregate[B](z: ⇒ B)(seqop: (B, N) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  18. 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
  19. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  20. def attributesToString: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  21. def brackets: Brackets
    Attributes
    protected
    Definition Classes
    EdgeLike
  22. def canEqual(that: Any): Boolean
    Definition Classes
    EdgeLike → IterableLike → Equals
  23. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  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 copyToArray[B >: N](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  29. def copyToArray[B >: N](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  30. def copyToArray[B >: N](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  31. def copyToBuffer[B >: N](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  32. def count(p: (N) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def directed: Boolean

    true if this edge is directed.

    true if this edge is directed.

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

    Same as directed.

    Same as directed.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  68. def isEmpty: Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  69. 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
    EdgeLike
  70. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  71. def isLabeled: Boolean

    true if this edge is labeled.

    true if this edge is labeled. See also label.

    Definition Classes
    EdgeLike
  72. 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
  73. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  74. final def isUndirected: Boolean

    Same as undirected.

    Same as undirected.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  75. 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
    LoopFreeEdgeEdgeLike
  76. def isValidCustomExceptionMessage: String
    Attributes
    protected
    Definition Classes
    LoopFreeEdgeEdgeLike
  77. 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.

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

    Sequence of the end points of this edge.

    Sequence of the end points of this edge.

    Definition Classes
    EdgeLike
  91. def nodesToString: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  92. def nodesToStringSeparator: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  93. def nodesToStringWithParenthesis: Boolean
    Attributes
    protected
    Definition Classes
    EdgeLike
  94. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. 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()
  96. final def nonLooping: Boolean

    Same as ! looping.

    Same as ! looping.

    Definition Classes
    EdgeLike
  97. final def notify(): Unit
    Definition Classes
    AnyRef
  98. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  99. def par: ParIterable[N]
    Definition Classes
    Parallelizable
  100. def parCombiner: Combiner[N, ParIterable[N]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  101. def partition(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  102. def product[B >: N](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def reduce[A1 >: N](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def reduceLeft[B >: N](op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce
  105. def reduceLeftOption[B >: N](op: (B, N) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. def reduceOption[A1 >: N](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def reduceRight[B >: N](op: (N, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  108. def reduceRightOption[B >: N](op: (N, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def repr: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  110. def reversed: List[N]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  111. def sameElements[B >: N](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  112. def scan[B >: N, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  113. def scanLeft[B, That](z: B)(op: (B, N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  114. 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.

  115. def seq: Iterable[N]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  116. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  118. def slice(from: Int, until: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  119. def sliding(size: Int, step: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  120. def sliding(size: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  121. def sources: Traversable[N]

    All source ends of this edge.

    All source ends of this edge.

    Definition Classes
    EdgeLike
  122. def span(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  123. def splitAt(n: Int): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  124. def stringPrefix: String
    Definition Classes
    EdgeLike → TraversableLike → GenTraversableLike
  125. def sum[B >: N](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  126. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  127. def tail: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  128. def tails: Iterator[Iterable[N]]
    Definition Classes
    TraversableLike
  129. def take(n: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  130. def takeRight(n: Int): Iterable[N]
    Definition Classes
    IterableLike
  131. def takeWhile(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  132. def targets: Traversable[N]

    All target ends of this edge.

    All target ends of this edge.

    Definition Classes
    EdgeLike
  133. def thisCollection: Iterable[N]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  134. final def thisSimpleClassName: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  135. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, N, Col[N]]): Col[N]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  136. def toArray[B >: N](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def toBuffer[B >: N]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def toCollection(repr: Iterable[N]): Iterable[N]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  139. def toIndexedSeq: IndexedSeq[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def toIterable: Iterable[N]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  141. def toIterator: Iterator[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  142. def toList: List[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. def toMap[T, U](implicit ev: <:<[N, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from LoopFreeEdge[N] to CollectionsHaveToParArray[LoopFreeEdge[N], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (LoopFreeEdge[N]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  145. def toSeq: Seq[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  146. def toSet[B >: N]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  147. def toStream: Stream[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  148. def toString(): String
    Definition Classes
    EdgeLike → TraversableLike → AnyRef → Any
  149. def toStringWithParenthesis: Boolean
    Attributes
    protected
    Definition Classes
    EdgeLike
  150. def toTraversable: Traversable[N]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  151. def toVector: Vector[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. 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.

  153. final def undirected: Boolean

    true if this edge is undirected.

    true if this edge is undirected.

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

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

    For weight types other than Long you may either convert then to Long prior to edge creation or define a custom edge class that includes the weight of the appropriate type and overrides def weight to provide the required conversion to Long.

    Definition Classes
    EdgeLike
  163. def withFilter(p: (N) ⇒ Boolean): FilterMonadic[N, Iterable[N]]
    Definition Classes
    TraversableLike → FilterMonadic
  164. def zip[A1 >: N, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[N], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  165. 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
  166. def zipWithIndex[A1 >: N, That](implicit bf: CanBuildFrom[Iterable[N], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  167. def [B](y: B): (LoopFreeEdge[N], B)
    Implicit
    This member is added by an implicit conversion from LoopFreeEdge[N] to ArrowAssoc[LoopFreeEdge[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 LoopFreeEdge[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:
    (loopFreeEdge: 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 LoopFreeEdge[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:
    (loopFreeEdge: 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 LoopFreeEdge[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:
    (loopFreeEdge: 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 LoopFreeEdge[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:
    (loopFreeEdge: MonadOps[N]).withFilter(p)
    Definition Classes
    MonadOps

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 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 CollectionsHaveToParArray from LoopFreeEdge[N] to CollectionsHaveToParArray[LoopFreeEdge[N], T]

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

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

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

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

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

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

Ungrouped