scalax.collection.mutable.AdjacencyListGraph

EdgeImpl

class EdgeImpl extends This.EdgeBase

Annotations
@SerialVersionUID( 7972L )
Linear Supertypes
This.EdgeBase, This.InnerEdgeLike, This.Edge, Serializable, Serializable, Iterable[This.NodeT], IterableLike[This.NodeT, Iterable[This.NodeT]], Equals, GenIterable[This.NodeT], GenIterableLike[This.NodeT, Iterable[This.NodeT]], Traversable[This.NodeT], GenTraversable[This.NodeT], GenericTraversableTemplate[This.NodeT, Iterable], TraversableLike[This.NodeT, Iterable[This.NodeT]], GenTraversableLike[This.NodeT, Iterable[This.NodeT]], Parallelizable[This.NodeT, ParIterable[This.NodeT]], TraversableOnce[This.NodeT], GenTraversableOnce[This.NodeT], FilterMonadic[This.NodeT, Iterable[This.NodeT]], HasNewBuilder[This.NodeT, Iterable[This.NodeT]], EdgeOut[N, E, This.NodeT, E], GraphParamEdge, GraphParamOut[N, E], GraphParam[N, E], AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. EdgeImpl
  2. EdgeBase
  3. InnerEdgeLike
  4. Edge
  5. Serializable
  6. Serializable
  7. Iterable
  8. IterableLike
  9. Equals
  10. GenIterable
  11. GenIterableLike
  12. Traversable
  13. GenTraversable
  14. GenericTraversableTemplate
  15. TraversableLike
  16. GenTraversableLike
  17. Parallelizable
  18. TraversableOnce
  19. GenTraversableOnce
  20. FilterMonadic
  21. HasNewBuilder
  22. EdgeOut
  23. GraphParamEdge
  24. GraphParamOut
  25. GraphParam
  26. AnyRef
  27. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new EdgeImpl(edge: E[This.NodeT])

Type Members

  1. type Self = Iterable[This.NodeT]

    Attributes
    protected
    Definition Classes
    TraversableLike

  2. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. def ++[B >: This.NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  5. def ++:[B >: This.NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That

    Definition Classes
    TraversableLike

  6. def ++:[B >: This.NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That

    Definition Classes
    TraversableLike

  7. def /:[B](z: B)(op: (B, This.NodeT) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  8. def :\[B](z: B)(op: (This.NodeT, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  9. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  10. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  11. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

  12. def addString(b: StringBuilder, sep: String): StringBuilder

    Definition Classes
    TraversableOnce

  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    TraversableOnce

  14. def adjacents: Set[This.EdgeT]

    All connecting edges, that is all edges at any of the nodes incident with this edge.

    All connecting edges, that is all edges at any of the nodes incident with this edge.

    returns

    set of connecting edges including hooks.

    Definition Classes
    InnerEdgeLike

  15. def aggregate[B](z: B)(seqop: (B, This.NodeT) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  16. final def asEdgeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G): GraphPredef.EdgeOut.asEdgeT.G.EdgeT

    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOut

  17. final def asEdgeTProjection[N <: N, E[X] <: EdgeLikeIn[X]]: GraphBase.EdgeT

    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOut

  18. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  19. def canEqual(that: Any): Boolean

    Definition Classes
    InnerEdgeLike → IterableLike → Equals

  20. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  21. def collect[B, That](pf: PartialFunction[This.NodeT, B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  22. def collectFirst[B](pf: PartialFunction[This.NodeT, B]): Option[B]

    Definition Classes
    TraversableOnce

  23. def companion: GenericCompanion[Iterable]

    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

  24. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  25. def copyToArray[B >: This.NodeT](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  26. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  27. def copyToBuffer[B >: This.NodeT](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce

  28. def count(p: (This.NodeT) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  29. def drop(n: Int): Iterable[This.NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  30. def dropRight(n: Int): Iterable[This.NodeT]

    Definition Classes
    IterableLike

  31. def dropWhile(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  32. val edge: E[This.NodeT]

    The outer edge after transformation by means of the copy method.

    The outer edge after transformation by means of the copy method. This edge contains references to inner nodes while the original outer edge contained references to outer nodes.

    Definition Classes
    EdgeImpl → EdgeBase → InnerEdgeLike → EdgeOut

  33. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  34. def equals(other: Any): Boolean

    Definition Classes
    InnerEdgeLike → Equals → AnyRef → Any

  35. def exists(p: (This.NodeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  36. def filter(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  37. def filterNot(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  38. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  39. def find(p: (This.NodeT) ⇒ Boolean): Option[This.NodeT]

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  40. def flatMap[B, That](f: (This.NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  41. def flatten[B](implicit asTraversable: (This.NodeT) ⇒ GenTraversableOnce[B]): Iterable[B]

    Definition Classes
    GenericTraversableTemplate

  42. def fold[A1 >: This.NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  43. final def fold[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton, T](g: G)(fa: (GraphPredef.EdgeOut.fold.G.EdgeT) ⇒ T, fb: (GraphBase.EdgeT) ⇒ T): T

    Definition Classes
    EdgeOut

  44. def foldLeft[B](z: B)(op: (B, This.NodeT) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  45. def foldRight[B](z: B)(op: (This.NodeT, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  46. def forall(p: (This.NodeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  47. def foreach[U](f: (This.NodeT) ⇒ U): Unit

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

  48. def genericBuilder[B]: Builder[B, Iterable[B]]

    Definition Classes
    GenericTraversableTemplate

  49. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  50. def groupBy[K](f: (This.NodeT) ⇒ K): Map[K, Iterable[This.NodeT]]

    Definition Classes
    TraversableLike → GenTraversableLike

  51. def grouped(size: Int): Iterator[Iterable[This.NodeT]]

    Definition Classes
    IterableLike

  52. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  53. def hashCode(): Int

    Definition Classes
    InnerEdgeLike → AnyRef → Any

  54. def head: This.NodeT

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  55. def headOption: Option[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  56. def init: Iterable[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  57. def inits: Iterator[Iterable[This.NodeT]]

    Definition Classes
    TraversableLike

  58. final def isContaining[N <: N, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean

    Definition Classes
    EdgeOut

  59. def isEdge: Boolean

    Definition Classes
    GraphParamEdge

  60. def isEmpty: Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  61. def isIn: Boolean

    Definition Classes
    GraphParamOut → GraphParam

  62. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  63. def isNode: Boolean

    Definition Classes
    GraphParamEdge

  64. def isOut: Boolean

    Definition Classes
    GraphParamOut → GraphParam

  65. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  66. def iterator: Iterator[This.NodeT]

    Definition Classes
    EdgeBase → IterableLike → GenIterableLike

  67. def last: This.NodeT

    Definition Classes
    TraversableLike → GenTraversableLike

  68. def lastOption: Option[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  69. def map[B, That](f: (This.NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  70. def max[B >: This.NodeT](implicit cmp: Ordering[B]): This.NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  71. def maxBy[B](f: (This.NodeT) ⇒ B)(implicit cmp: Ordering[B]): This.NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  72. def min[B >: This.NodeT](implicit cmp: Ordering[B]): This.NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  73. def minBy[B](f: (This.NodeT) ⇒ B)(implicit cmp: Ordering[B]): This.NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  74. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  75. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  76. def mkString(start: String, sep: String, end: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  77. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  78. def newBuilder: Builder[This.NodeT, Iterable[This.NodeT]]

    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder

  79. final def nodes: Iterable[This.NodeT]

    The inner nodes incident with this inner edge.

    The inner nodes incident with this inner edge. This is just a synonym to this that extends Iterable[NodeT].

    Definition Classes
    InnerEdgeLike
    Annotations
    @inline()

  80. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  81. final def notify(): Unit

    Definition Classes
    AnyRef

  82. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  83. def par: ParIterable[This.NodeT]

    Definition Classes
    Parallelizable

  84. def parCombiner: Combiner[This.NodeT, ParIterable[This.NodeT]]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable

  85. def partition(p: (This.NodeT) ⇒ Boolean): (Iterable[This.NodeT], Iterable[This.NodeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  86. def privateNodes: Set[This.NodeT]

    Finds nodes of this edge which only participate in this edge.

    Finds nodes of this edge which only participate in this edge.

    returns

    those nodes of this edge which do not participate in any other edge

    Definition Classes
    InnerEdgeLike

  87. def product[B >: This.NodeT](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  88. def reduce[A1 >: This.NodeT](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  89. def reduceLeft[B >: This.NodeT](op: (B, This.NodeT) ⇒ B): B

    Definition Classes
    TraversableOnce

  90. def reduceLeftOption[B >: This.NodeT](op: (B, This.NodeT) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  91. def reduceOption[A1 >: This.NodeT](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  92. def reduceRight[B >: This.NodeT](op: (This.NodeT, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  93. def reduceRightOption[B >: This.NodeT](op: (This.NodeT, B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  94. def remove: Boolean

  95. def removeWithNodes(edge: E[N]): Boolean

  96. def repr: Iterable[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  97. def reversed: List[This.NodeT]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  98. def sameElements[B >: This.NodeT](that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike → GenIterableLike

  99. def scan[B >: This.NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[This.NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  100. def scanLeft[B, That](z: B)(op: (B, This.NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  101. def scanRight[B, That](z: B)(op: (This.NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], 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.

  102. def seq: Iterable[This.NodeT]

    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

  103. def size: Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  104. def slice(from: Int, until: Int): Iterable[This.NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  105. def sliding(size: Int, step: Int): Iterator[Iterable[This.NodeT]]

    Definition Classes
    IterableLike

  106. def sliding(size: Int): Iterator[Iterable[This.NodeT]]

    Definition Classes
    IterableLike

  107. def span(p: (This.NodeT) ⇒ Boolean): (Iterable[This.NodeT], Iterable[This.NodeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  108. def splitAt(n: Int): (Iterable[This.NodeT], Iterable[This.NodeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  109. def stringPrefix: String

    Definition Classes
    EdgeBase → TraversableLike → GenTraversableLike → EdgeOut

  110. def sum[B >: This.NodeT](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  111. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  112. def tail: Iterable[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  113. def tails: Iterator[Iterable[This.NodeT]]

    Definition Classes
    TraversableLike

  114. def take(n: Int): Iterable[This.NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  115. def takeRight(n: Int): Iterable[This.NodeT]

    Definition Classes
    IterableLike

  116. def takeWhile(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  117. def thisCollection: Iterable[This.NodeT]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  118. def to: This.NodeT

    Definition Classes
    InnerEdgeLike

  119. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, This.NodeT, Col[This.NodeT]]): Col[This.NodeT]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  120. def toArray[B >: This.NodeT](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  121. def toBuffer[B >: This.NodeT]: Buffer[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  122. def toCollection(repr: Iterable[This.NodeT]): Iterable[This.NodeT]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  123. def toEdgeIn: E[N]

    Reconstructs the outer edge by means of the copymethod.

    Reconstructs the outer edge by means of the copymethod.

    Definition Classes
    InnerEdgeLike

  124. final def toEdgeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G)(f: (GraphBase.EdgeT) ⇒ GraphPredef.EdgeOut.toEdgeT.G.EdgeT): GraphPredef.EdgeOut.toEdgeT.G.EdgeT

    Definition Classes
    EdgeOut

  125. def toIndexedSeq: IndexedSeq[This.NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  126. def toIterable: Iterable[This.NodeT]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  127. def toIterator: Iterator[This.NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  128. def toList: List[This.NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  129. def toMap[T, U](implicit ev: <:<[This.NodeT, (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  130. def toSeq: Seq[This.NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  131. def toSet[B >: This.NodeT]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  132. def toStream: Stream[This.NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  133. def toString(): String

    Definition Classes
    InnerEdgeLike → TraversableLike → AnyRef → Any

  134. def toTraversable: Traversable[This.NodeT]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  135. def toVector: Vector[This.NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  136. def transpose[B](implicit asTraversable: (This.NodeT) ⇒ 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.

  137. def unzip[A1, A2](implicit asPair: (This.NodeT) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

    Definition Classes
    GenericTraversableTemplate

  138. def unzip3[A1, A2, A3](implicit asTriple: (This.NodeT) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

    Definition Classes
    GenericTraversableTemplate

  139. def view(from: Int, until: Int): IterableView[This.NodeT, Iterable[This.NodeT]]

    Definition Classes
    IterableLike → TraversableLike

  140. def view: IterableView[This.NodeT, Iterable[This.NodeT]]

    Definition Classes
    IterableLike → TraversableLike

  141. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  142. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  143. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  144. def withFilter(p: (This.NodeT) ⇒ Boolean): FilterMonadic[This.NodeT, Iterable[This.NodeT]]

    Definition Classes
    TraversableLike → FilterMonadic

  145. def zip[A1 >: This.NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike

  146. def zipAll[B, A1 >: This.NodeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike

  147. def zipWithIndex[A1 >: This.NodeT, That](implicit bf: CanBuildFrom[Iterable[This.NodeT], (A1, Int), That]): That

    Definition Classes
    IterableLike → GenIterableLike

  148. final def ~~: Set[This.EdgeT]

    Synonym for adjacents.

    Synonym for adjacents.

    Definition Classes
    InnerEdgeLike
    Annotations
    @inline()

Deprecated Value Members

  1. def /:\[A1 >: This.NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

Inherited from This.EdgeBase

Inherited from This.InnerEdgeLike

Inherited from This.Edge

Inherited from Serializable

Inherited from Serializable

Inherited from Iterable[This.NodeT]

Inherited from IterableLike[This.NodeT, Iterable[This.NodeT]]

Inherited from Equals

Inherited from GenIterable[This.NodeT]

Inherited from GenIterableLike[This.NodeT, Iterable[This.NodeT]]

Inherited from Traversable[This.NodeT]

Inherited from GenTraversable[This.NodeT]

Inherited from GenericTraversableTemplate[This.NodeT, Iterable]

Inherited from TraversableLike[This.NodeT, Iterable[This.NodeT]]

Inherited from GenTraversableLike[This.NodeT, Iterable[This.NodeT]]

Inherited from Parallelizable[This.NodeT, ParIterable[This.NodeT]]

Inherited from TraversableOnce[This.NodeT]

Inherited from GenTraversableOnce[This.NodeT]

Inherited from FilterMonadic[This.NodeT, Iterable[This.NodeT]]

Inherited from HasNewBuilder[This.NodeT, Iterable[This.NodeT]]

Inherited from EdgeOut[N, E, This.NodeT, E]

Inherited from GraphParamEdge

Inherited from GraphParamOut[N, E]

Inherited from GraphParam[N, E]

Inherited from AnyRef

Inherited from Any

Ungrouped