Packages

c

scalax.collection.GraphTraversalImpl

StrongComponentTraverser

case class StrongComponentTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphTraversalImpl.this)#NodeFilter, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter, ordering: (GraphTraversalImpl.this)#ElemOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight]) extends (GraphTraversalImpl.this)#StrongComponentTraverser with Product with Serializable

Attributes
protected
Linear Supertypes
Serializable, Serializable, Product, (GraphTraversalImpl.this)#StrongComponentTraverser, Iterable[(GraphTraversalImpl.this)#Component], IterableLike[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]], Equals, GenIterable[(GraphTraversalImpl.this)#Component], GenIterableLike[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]], Traversable[(GraphTraversalImpl.this)#Component], GenTraversable[(GraphTraversalImpl.this)#Component], GenericTraversableTemplate[(GraphTraversalImpl.this)#Component, Iterable], TraversableLike[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]], GenTraversableLike[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]], Parallelizable[(GraphTraversalImpl.this)#Component, ParIterable[(GraphTraversalImpl.this)#Component]], TraversableOnce[(GraphTraversalImpl.this)#Component], GenTraversableOnce[(GraphTraversalImpl.this)#Component], FilterMonadic[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]], HasNewBuilder[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]], (GraphTraversalImpl.this)#Properties, (GraphTraversalImpl.this)#SubgraphProperties, (GraphTraversalImpl.this)#FluentProperties[(GraphTraversalImpl.this)#StrongComponentTraverser], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. StrongComponentTraverser
  2. Serializable
  3. Serializable
  4. Product
  5. StrongComponentTraverser
  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. Properties
  22. SubgraphProperties
  23. FluentProperties
  24. AnyRef
  25. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by ChainingOps
  5. by EdgeAssoc
  6. by TraversableEnrichments
  7. by any2stringadd
  8. by StringFormat
  9. by Ensuring
  10. by ArrowAssoc
  11. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new StrongComponentTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphTraversalImpl.this)#NodeFilter, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter, ordering: (GraphTraversalImpl.this)#ElemOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight])

Type Members

  1. type Self = Iterable[(GraphTraversalImpl.this)#Component]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. 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 (GraphTraversalImpl.this)#StrongComponentTraverser to any2stringadd[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ++[B >: (GraphTraversalImpl.this)#Component, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#Component], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: (GraphTraversalImpl.this)#Component, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#Component], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: (GraphTraversalImpl.this)#Component, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#Component], B, That]): That
    Definition Classes
    TraversableLike
  7. def ->[B](y: B): ((GraphTraversalImpl.this)#StrongComponentTraverser, B)
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to ArrowAssoc[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  10. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  11. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  12. def aggregate[B](z: ⇒ B)(seqop: (B, (GraphTraversalImpl.this)#Component) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  13. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  14. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  15. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @HotSpotIntrinsicCandidate()
  16. def collect[B, That](pf: PartialFunction[(GraphTraversalImpl.this)#Component, B])(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#Component], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  17. def collectFirst[B](pf: PartialFunction[(GraphTraversalImpl.this)#Component, B]): Option[B]
    Definition Classes
    TraversableOnce
  18. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  19. lazy val components: Iterable[(GraphTraversalImpl.this)#Component]
    Attributes
    protected
  20. def copyToArray[B >: (GraphTraversalImpl.this)#Component](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  21. def copyToArray[B >: (GraphTraversalImpl.this)#Component](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  22. def copyToArray[B >: (GraphTraversalImpl.this)#Component](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  23. def copyToBuffer[B >: (GraphTraversalImpl.this)#Component](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  24. def count(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  25. def drop(n: Int): Iterable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  26. def dropRight(n: Int): Iterable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    IterableLike
  27. def dropWhile(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Iterable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    TraversableLike → GenTraversableLike
  28. def ensuring(cond: ((GraphTraversalImpl.this)#StrongComponentTraverser) ⇒ Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#StrongComponentTraverser
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to Ensuring[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  29. def ensuring(cond: ((GraphTraversalImpl.this)#StrongComponentTraverser) ⇒ Boolean): (GraphTraversalImpl.this)#StrongComponentTraverser
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to Ensuring[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  30. def ensuring(cond: Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#StrongComponentTraverser
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to Ensuring[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  31. def ensuring(cond: Boolean): (GraphTraversalImpl.this)#StrongComponentTraverser
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to Ensuring[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  32. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  33. def exists(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  34. def filter(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Iterable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    TraversableLike → GenTraversableLike
  35. def filterNot(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Iterable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    TraversableLike → GenTraversableLike
  36. def find(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Option[(GraphTraversalImpl.this)#Component]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  37. def flatMap[B, That](f: ((GraphTraversalImpl.this)#Component) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#Component], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  38. def flatten[B](implicit asTraversable: ((GraphTraversalImpl.this)#Component) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  39. def fold[A1 >: (GraphTraversalImpl.this)#Component](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  40. def foldLeft[B](z: B)(op: (B, (GraphTraversalImpl.this)#Component) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  41. def foldRight[B](z: B)(op: ((GraphTraversalImpl.this)#Component, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  42. def forall(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  43. def foreach[U](f: ((GraphTraversalImpl.this)#Component) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  44. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to StringFormat[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  45. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  46. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  47. def groupBy[K](f: ((GraphTraversalImpl.this)#Component) ⇒ K): Map[K, Iterable[(GraphTraversalImpl.this)#Component]]
    Definition Classes
    TraversableLike → GenTraversableLike
  48. def grouped(size: Int): Iterator[Iterable[(GraphTraversalImpl.this)#Component]]
    Definition Classes
    IterableLike
  49. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  50. def head: (GraphTraversalImpl.this)#Component
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  51. def headOption: Option[(GraphTraversalImpl.this)#Component]
    Definition Classes
    TraversableLike → GenTraversableLike
  52. def init: Iterable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    TraversableLike → GenTraversableLike
  53. def inits: Iterator[Iterable[(GraphTraversalImpl.this)#Component]]
    Definition Classes
    TraversableLike
  54. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to OuterNode[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  55. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to OuterNode[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  56. def isEmpty: Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  57. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to OuterNode[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  58. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  59. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to OuterNode[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  60. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to OuterNode[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  61. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  62. def iterator: Iterator[(GraphTraversalImpl.this)#Component]
    Definition Classes
    StrongComponentTraverser → IterableLike → GenIterableLike
  63. def last: (GraphTraversalImpl.this)#Component
    Definition Classes
    TraversableLike → GenTraversableLike
  64. def lastOption: Option[(GraphTraversalImpl.this)#Component]
    Definition Classes
    TraversableLike → GenTraversableLike
  65. def map[B, That](f: ((GraphTraversalImpl.this)#Component) ⇒ B)(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#Component], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  66. def max[B >: (GraphTraversalImpl.this)#Component](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#Component
    Definition Classes
    TraversableOnce → GenTraversableOnce
  67. def maxBy[B](f: ((GraphTraversalImpl.this)#Component) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#Component
    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. val maxWeight: Option[(GraphTraversalImpl.this)#Weight]

    An optional maximum weight that limits the scope of the traversal or search.

    An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

    Definition Classes
    StrongComponentTraverser → Properties
  69. def min[B >: (GraphTraversalImpl.this)#Component](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#Component
    Definition Classes
    TraversableOnce → GenTraversableOnce
  70. def minBy[B](f: ((GraphTraversalImpl.this)#Component) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#Component
    Definition Classes
    TraversableOnce → GenTraversableOnce
  71. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  72. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  73. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. val n1: (GraphTraversalImpl.this)#StrongComponentTraverser
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to EdgeAssoc[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  75. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  76. def newBuilder: Builder[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  77. final def newTraverser: ((GraphTraversalImpl.this)#NodeT, Parameters, (GraphTraversalImpl.this)#NodeFilter, (GraphTraversalImpl.this)#EdgeFilter, (GraphTraversalImpl.this)#ElemOrdering, Option[(GraphTraversalImpl.this)#Weight]) ⇒ (GraphTraversalImpl.this)#StrongComponentTraverser
    Attributes
    protected
    Definition Classes
    StrongComponentTraverser → FluentProperties
  78. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  80. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  81. val ordering: (GraphTraversalImpl.this)#ElemOrdering

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    Definition Classes
    StrongComponentTraverser → Properties
  82. def par: ParIterable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    Parallelizable
  83. def parCombiner: Combiner[(GraphTraversalImpl.this)#Component, ParIterable[(GraphTraversalImpl.this)#Component]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  84. val parameters: Parameters

    The properties controlling subsequent traversals.

    The properties controlling subsequent traversals.

    Definition Classes
    StrongComponentTraverser → Properties
  85. def partition(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): (Iterable[(GraphTraversalImpl.this)#Component], Iterable[(GraphTraversalImpl.this)#Component])
    Definition Classes
    TraversableLike → GenTraversableLike
  86. def pipe[B](f: ((GraphTraversalImpl.this)#StrongComponentTraverser) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to ChainingOps[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  87. def product[B >: (GraphTraversalImpl.this)#Component](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def reduce[A1 >: (GraphTraversalImpl.this)#Component](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def reduceLeft[B >: (GraphTraversalImpl.this)#Component](op: (B, (GraphTraversalImpl.this)#Component) ⇒ B): B
    Definition Classes
    TraversableOnce
  90. def reduceLeftOption[B >: (GraphTraversalImpl.this)#Component](op: (B, (GraphTraversalImpl.this)#Component) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def reduceOption[A1 >: (GraphTraversalImpl.this)#Component](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def reduceRight[B >: (GraphTraversalImpl.this)#Component](op: ((GraphTraversalImpl.this)#Component, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  93. def reduceRightOption[B >: (GraphTraversalImpl.this)#Component](op: ((GraphTraversalImpl.this)#Component, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def repr: Iterable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    TraversableLike → GenTraversableLike
  95. def reversed: List[(GraphTraversalImpl.this)#Component]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  96. val root: (GraphTraversalImpl.this)#NodeT

    The node where subsequent graph traversals start.

    The node where subsequent graph traversals start.

    Definition Classes
    StrongComponentTraverser → Properties
  97. def sameElements[B >: (GraphTraversalImpl.this)#Component](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  98. def scan[B >: (GraphTraversalImpl.this)#Component, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#Component], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  99. def scanLeft[B, That](z: B)(op: (B, (GraphTraversalImpl.this)#Component) ⇒ B)(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#Component], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def scanRight[B, That](z: B)(op: ((GraphTraversalImpl.this)#Component, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#Component], 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.

  101. val self: (GraphTraversalImpl.this)#StrongComponentTraverser
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to ChainingOps[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  102. def seq: Iterable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  103. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  105. def slice(from: Int, until: Int): Iterable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  106. def sliding(size: Int, step: Int): Iterator[Iterable[(GraphTraversalImpl.this)#Component]]
    Definition Classes
    IterableLike
  107. def sliding(size: Int): Iterator[Iterable[(GraphTraversalImpl.this)#Component]]
    Definition Classes
    IterableLike
  108. def span(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): (Iterable[(GraphTraversalImpl.this)#Component], Iterable[(GraphTraversalImpl.this)#Component])
    Definition Classes
    TraversableLike → GenTraversableLike
  109. def splitAt(n: Int): (Iterable[(GraphTraversalImpl.this)#Component], Iterable[(GraphTraversalImpl.this)#Component])
    Definition Classes
    TraversableLike → GenTraversableLike
  110. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  111. val subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    Definition Classes
    StrongComponentTraverser → SubgraphProperties
  112. val subgraphNodes: (GraphTraversalImpl.this)#NodeFilter

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    Definition Classes
    StrongComponentTraverser → SubgraphProperties
  113. def sum[B >: (GraphTraversalImpl.this)#Component](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  115. val t: Iterable[(GraphTraversalImpl.this)#Component]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to TraversableEnrichments[(GraphTraversalImpl.this)#Component, Iterable] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  116. def tail: Iterable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    TraversableLike → GenTraversableLike
  117. def tails: Iterator[Iterable[(GraphTraversalImpl.this)#Component]]
    Definition Classes
    TraversableLike
  118. def take(n: Int): Iterable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  119. def takeRight(n: Int): Iterable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    IterableLike
  120. def takeWhile(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Iterable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  121. def tap[U](f: ((GraphTraversalImpl.this)#StrongComponentTraverser) ⇒ U): (GraphTraversalImpl.this)#StrongComponentTraverser
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to ChainingOps[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  122. def thisCollection: Iterable[(GraphTraversalImpl.this)#Component]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  123. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (GraphTraversalImpl.this)#Component, Col[(GraphTraversalImpl.this)#Component]]): Col[(GraphTraversalImpl.this)#Component]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  124. def toArray[B >: (GraphTraversalImpl.this)#Component](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  125. def toBuffer[B >: (GraphTraversalImpl.this)#Component]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  126. def toCollection(repr: Iterable[(GraphTraversalImpl.this)#Component]): Iterable[(GraphTraversalImpl.this)#Component]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  127. def toIndexedSeq: IndexedSeq[(GraphTraversalImpl.this)#Component]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  128. final def toInnerElemTraverser(root: (GraphTraversalImpl.this)#NodeT): (GraphTraversalImpl.this)#InnerElemTraverser
    Definition Classes
    FluentProperties
  129. def toIterable: Iterable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  130. def toIterator: Iterator[(GraphTraversalImpl.this)#Component]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  131. def toList: List[(GraphTraversalImpl.this)#Component]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. def toMap[T, U](implicit ev: <:<[(GraphTraversalImpl.this)#Component, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def toOuterNodes[E[+X] <: EdgeLike[X]]: Seq[InParam[(GraphTraversalImpl.this)#Component, E]]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to TraversableEnrichments[(GraphTraversalImpl.this)#Component, Iterable] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  134. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to CollectionsHaveToParArray[(GraphTraversalImpl.this)#StrongComponentTraverser, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type ((GraphTraversalImpl.this)#StrongComponentTraverser) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  135. def toSeq: Seq[(GraphTraversalImpl.this)#Component]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def toSet[B >: (GraphTraversalImpl.this)#Component]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def toStream: Stream[(GraphTraversalImpl.this)#Component]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  138. def toString(): String
    Definition Classes
    TraversableLike → Any
  139. def toTraversable: Traversable[(GraphTraversalImpl.this)#Component]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  140. def toVector: Vector[(GraphTraversalImpl.this)#Component]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  141. def transpose[B](implicit asTraversable: ((GraphTraversalImpl.this)#Component) ⇒ 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.

  142. def unzip[A1, A2](implicit asPair: ((GraphTraversalImpl.this)#Component) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  143. def unzip3[A1, A2, A3](implicit asTriple: ((GraphTraversalImpl.this)#Component) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  144. val value: (GraphTraversalImpl.this)#StrongComponentTraverser
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to OuterNode[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  145. def view(from: Int, until: Int): IterableView[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]]
    Definition Classes
    IterableLike → TraversableLike
  146. def view: IterableView[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]]
    Definition Classes
    IterableLike → TraversableLike
  147. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  148. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  149. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  150. final def withDirection(direction: Direction): (GraphTraversalImpl.this)#StrongComponentTraverser

    Creates a new FluentProperties based on this except for an updated direction.

    Creates a new FluentProperties based on this except for an updated direction. Note that methods returning a Cycle or Path accept only Successors.

    Definition Classes
    FluentProperties
  151. def withFilter(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): FilterMonadic[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]]
    Definition Classes
    TraversableLike → FilterMonadic
  152. final def withKind(kind: Kind): (GraphTraversalImpl.this)#StrongComponentTraverser

    Creates a new FluentProperties based on this except for an updated kind.

    Creates a new FluentProperties based on this except for an updated kind.

    Definition Classes
    FluentProperties
  153. final def withMaxDepth(maxDepth: Int): (GraphTraversalImpl.this)#StrongComponentTraverser

    Creates a new FluentProperties based on this except for an updated maxDepth.

    Creates a new FluentProperties based on this except for an updated maxDepth.

    Definition Classes
    FluentProperties
  154. final def withMaxWeight(max: Long): (GraphTraversalImpl.this)#StrongComponentTraverser

    Creates a new FluentProperties based on this except for an updated maxWeight having the given max and the default weight function returning edge.weight.

    Creates a new FluentProperties based on this except for an updated maxWeight having the given max and the default weight function returning edge.weight.

    Definition Classes
    FluentProperties
  155. final def withMaxWeight[W](max: W, edgeWeight: ((GraphTraversalImpl.this)#EdgeT) ⇒ W)(implicit arg0: Numeric[W]): (GraphTraversalImpl.this)#StrongComponentTraverser

    Creates a new FluentProperties based on this except for an updated maxWeight having the given max value and the given weight function.

    Creates a new FluentProperties based on this except for an updated maxWeight having the given max value and the given weight function.

    Definition Classes
    FluentProperties
  156. def withMaxWeight(maxWeight: Option[(GraphTraversalImpl.this)#Weight]): (GraphTraversalImpl.this)#StrongComponentTraverser

    Creates a new FluentProperties based on this except for an updated maxWeight.

    Creates a new FluentProperties based on this except for an updated maxWeight.

    Definition Classes
    FluentProperties
  157. final def withOrdering(ordering: (GraphTraversalImpl.this)#ElemOrdering): (GraphTraversalImpl.this)#StrongComponentTraverser

    Creates a new FluentProperties based on this except for an updated ordering.

    Creates a new FluentProperties based on this except for an updated ordering.

    Definition Classes
    FluentProperties
  158. final def withParameters(parameters: Parameters): (GraphTraversalImpl.this)#StrongComponentTraverser

    Creates a new FluentProperties based on this except for an updated parameters.

    Creates a new FluentProperties based on this except for an updated parameters.

    Definition Classes
    FluentProperties
  159. final def withSubgraph(nodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, edges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge): (GraphTraversalImpl.this)#StrongComponentTraverser

    Creates a new FluentProperties based on this except for an updated subgraphNodes and/or subgraphEdges.

    Creates a new FluentProperties based on this except for an updated subgraphNodes and/or subgraphEdges.

    Definition Classes
    FluentProperties
  160. def zip[A1 >: (GraphTraversalImpl.this)#Component, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#Component], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  161. def zipAll[B, A1 >: (GraphTraversalImpl.this)#Component, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#Component], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  162. def zipWithIndex[A1 >: (GraphTraversalImpl.this)#Component, That](implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#Component], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  163. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to EdgeAssoc[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  164. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to EdgeAssoc[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  165. def →[B](y: B): ((GraphTraversalImpl.this)#StrongComponentTraverser, B)
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to ArrowAssoc[(GraphTraversalImpl.this)#StrongComponentTraverser] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def filter(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): TraversableOnce[(GraphTraversalImpl.this)#Component]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to MonadOps[(GraphTraversalImpl.this)#Component] 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:
    (strongComponentTraverser: MonadOps[(GraphTraversalImpl.this)#Component]).filter(p)
    Definition Classes
    MonadOps
  2. def flatMap[B](f: ((GraphTraversalImpl.this)#Component) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to MonadOps[(GraphTraversalImpl.this)#Component] 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:
    (strongComponentTraverser: MonadOps[(GraphTraversalImpl.this)#Component]).flatMap(f)
    Definition Classes
    MonadOps
  3. def map[B](f: ((GraphTraversalImpl.this)#Component) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to MonadOps[(GraphTraversalImpl.this)#Component] 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:
    (strongComponentTraverser: MonadOps[(GraphTraversalImpl.this)#Component]).map(f)
    Definition Classes
    MonadOps
  4. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to OuterNode[(GraphTraversalImpl.this)#StrongComponentTraverser] 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:
    (strongComponentTraverser: OuterNode[(GraphTraversalImpl.this)#StrongComponentTraverser]).stringPrefix
    Definition Classes
    NodeParam
  5. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to OuterNode[(GraphTraversalImpl.this)#StrongComponentTraverser] 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:
    (strongComponentTraverser: OuterNode[(GraphTraversalImpl.this)#StrongComponentTraverser]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  6. def withFilter(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Iterator[(GraphTraversalImpl.this)#Component]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentTraverser to MonadOps[(GraphTraversalImpl.this)#Component] 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:
    (strongComponentTraverser: MonadOps[(GraphTraversalImpl.this)#Component]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

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

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: ((GraphTraversalImpl.this)#Component, 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 Product

Inherited from (GraphTraversalImpl.this)#StrongComponentTraverser

Inherited from Iterable[(GraphTraversalImpl.this)#Component]

Inherited from IterableLike[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]]

Inherited from Equals

Inherited from GenIterable[(GraphTraversalImpl.this)#Component]

Inherited from GenIterableLike[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]]

Inherited from Traversable[(GraphTraversalImpl.this)#Component]

Inherited from GenTraversable[(GraphTraversalImpl.this)#Component]

Inherited from GenericTraversableTemplate[(GraphTraversalImpl.this)#Component, Iterable]

Inherited from TraversableLike[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]]

Inherited from GenTraversableLike[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]]

Inherited from Parallelizable[(GraphTraversalImpl.this)#Component, ParIterable[(GraphTraversalImpl.this)#Component]]

Inherited from TraversableOnce[(GraphTraversalImpl.this)#Component]

Inherited from GenTraversableOnce[(GraphTraversalImpl.this)#Component]

Inherited from FilterMonadic[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]]

Inherited from HasNewBuilder[(GraphTraversalImpl.this)#Component, Iterable[(GraphTraversalImpl.this)#Component]]

Inherited from (GraphTraversalImpl.this)#Properties

Inherited from (GraphTraversalImpl.this)#SubgraphProperties

Inherited from (GraphTraversalImpl.this)#FluentProperties[(GraphTraversalImpl.this)#StrongComponentTraverser]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from (GraphTraversalImpl.this)#StrongComponentTraverser to OuterNode[(GraphTraversalImpl.this)#StrongComponentTraverser]

Inherited by implicit conversion CollectionsHaveToParArray from (GraphTraversalImpl.this)#StrongComponentTraverser to CollectionsHaveToParArray[(GraphTraversalImpl.this)#StrongComponentTraverser, T]

Inherited by implicit conversion MonadOps from (GraphTraversalImpl.this)#StrongComponentTraverser to MonadOps[(GraphTraversalImpl.this)#Component]

Inherited by implicit conversion ChainingOps from (GraphTraversalImpl.this)#StrongComponentTraverser to ChainingOps[(GraphTraversalImpl.this)#StrongComponentTraverser]

Inherited by implicit conversion EdgeAssoc from (GraphTraversalImpl.this)#StrongComponentTraverser to EdgeAssoc[(GraphTraversalImpl.this)#StrongComponentTraverser]

Inherited by implicit conversion TraversableEnrichments from (GraphTraversalImpl.this)#StrongComponentTraverser to TraversableEnrichments[(GraphTraversalImpl.this)#Component, Iterable]

Inherited by implicit conversion any2stringadd from (GraphTraversalImpl.this)#StrongComponentTraverser to any2stringadd[(GraphTraversalImpl.this)#StrongComponentTraverser]

Inherited by implicit conversion StringFormat from (GraphTraversalImpl.this)#StrongComponentTraverser to StringFormat[(GraphTraversalImpl.this)#StrongComponentTraverser]

Inherited by implicit conversion Ensuring from (GraphTraversalImpl.this)#StrongComponentTraverser to Ensuring[(GraphTraversalImpl.this)#StrongComponentTraverser]

Inherited by implicit conversion ArrowAssoc from (GraphTraversalImpl.this)#StrongComponentTraverser to ArrowAssoc[(GraphTraversalImpl.this)#StrongComponentTraverser]

Inherited by implicit conversion alternateImplicit from (GraphTraversalImpl.this)#StrongComponentTraverser to ForceImplicitAmbiguity

Ungrouped