case class ComponentTraverser(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)#ComponentTraverser with Product with Serializable
- Attributes
- protected
- Alphabetic
- By Inheritance
- ComponentTraverser
- Serializable
- Serializable
- Product
- Equals
- ComponentTraverser
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- Properties
- SubgraphProperties
- FluentProperties
- AnyRef
- Any
- by anyToNode
- by CollectionsHaveToParArray
- by MonadOps
- by EdgeAssoc
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- by alternateImplicit
- Hide All
- Show All
- Public
- All
Instance Constructors
- new ComponentTraverser(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
-
type
Self = Traversable[(GraphTraversalImpl.this)#Component]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
+(other: String): String
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to any2stringadd[(GraphTraversalImpl.this)#ComponentTraverser] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
-
def
++[B >: (GraphTraversalImpl.this)#Component, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#Component], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: (GraphTraversalImpl.this)#Component, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#Component], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: (GraphTraversalImpl.this)#Component, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#Component], B, That]): That
- Definition Classes
- TraversableLike
-
def
->[B](y: B): ((GraphTraversalImpl.this)#ComponentTraverser, B)
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to ArrowAssoc[(GraphTraversalImpl.this)#ComponentTraverser] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
-
def
/:[B](z: B)(op: (B, (GraphTraversalImpl.this)#Component) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: ((GraphTraversalImpl.this)#Component, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, (GraphTraversalImpl.this)#Component) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
collect[B, That](pf: PartialFunction[(GraphTraversalImpl.this)#Component, B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#Component], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[(GraphTraversalImpl.this)#Component, B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
companion: GenericCompanion[Traversable]
- Definition Classes
- Traversable → GenTraversable → GenericTraversableTemplate
-
lazy val
components: Iterable[(GraphTraversalImpl.this)#WeakComponentImpl]
- Attributes
- protected
-
def
copyToArray[B >: (GraphTraversalImpl.this)#Component](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (GraphTraversalImpl.this)#Component](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (GraphTraversalImpl.this)#Component](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: (GraphTraversalImpl.this)#Component](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
drop(n: Int): Traversable[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
dropWhile(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
ensuring(cond: ((GraphTraversalImpl.this)#ComponentTraverser) ⇒ Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#ComponentTraverser
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to Ensuring[(GraphTraversalImpl.this)#ComponentTraverser] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: ((GraphTraversalImpl.this)#ComponentTraverser) ⇒ Boolean): (GraphTraversalImpl.this)#ComponentTraverser
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to Ensuring[(GraphTraversalImpl.this)#ComponentTraverser] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#ComponentTraverser
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to Ensuring[(GraphTraversalImpl.this)#ComponentTraverser] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean): (GraphTraversalImpl.this)#ComponentTraverser
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to Ensuring[(GraphTraversalImpl.this)#ComponentTraverser] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
exists(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Option[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
findCycle[U](implicit visitor: ((GraphTraversalImpl.this)#InnerElem) ⇒ U = empty): Option[(GraphTraversalImpl.this)#Cycle]
- Definition Classes
- ComponentTraverser → ComponentTraverser
-
def
flatMap[B, That](f: ((GraphTraversalImpl.this)#Component) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#Component], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: ((GraphTraversalImpl.this)#Component) ⇒ GenTraversableOnce[B]): Traversable[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: (GraphTraversalImpl.this)#Component](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, (GraphTraversalImpl.this)#Component) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: ((GraphTraversalImpl.this)#Component, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
forall(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: ((GraphTraversalImpl.this)#Component) ⇒ U): Unit
- Definition Classes
- ComponentTraverser → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to StringFormat[(GraphTraversalImpl.this)#ComponentTraverser] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
def
genericBuilder[B]: Builder[B, Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
groupBy[K](f: ((GraphTraversalImpl.this)#Component) ⇒ K): Map[K, Traversable[(GraphTraversalImpl.this)#Component]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
head: (GraphTraversalImpl.this)#Component
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
headOption: Option[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
init: Traversable[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[Traversable[(GraphTraversalImpl.this)#Component]]
- Definition Classes
- TraversableLike
-
def
isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to OuterNode[(GraphTraversalImpl.this)#ComponentTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
-
def
isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to OuterNode[(GraphTraversalImpl.this)#ComponentTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
isEmpty: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
isIn: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to OuterNode[(GraphTraversalImpl.this)#ComponentTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → Param
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isNode: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to OuterNode[(GraphTraversalImpl.this)#ComponentTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
isOut: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to OuterNode[(GraphTraversalImpl.this)#ComponentTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → Param
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
last: (GraphTraversalImpl.this)#Component
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
map[B, That](f: ((GraphTraversalImpl.this)#Component) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#Component], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
max[B >: (GraphTraversalImpl.this)#Component](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#Component
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: ((GraphTraversalImpl.this)#Component) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#Component
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
val
maxWeight: Option[(GraphTraversalImpl.this)#Weight]
- Definition Classes
- ComponentTraverser → Properties
-
def
min[B >: (GraphTraversalImpl.this)#Component](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#Component
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: ((GraphTraversalImpl.this)#Component) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#Component
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
val
n1: (GraphTraversalImpl.this)#ComponentTraverser
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to EdgeAssoc[(GraphTraversalImpl.this)#ComponentTraverser] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[(GraphTraversalImpl.this)#Component, Traversable[(GraphTraversalImpl.this)#Component]]
- Attributes
- protected[this]
- Definition Classes
- GenericTraversableTemplate → HasNewBuilder
-
final
def
newTraverser: ((GraphTraversalImpl.this)#NodeT, Parameters, (GraphTraversalImpl.this)#NodeFilter, (GraphTraversalImpl.this)#EdgeFilter, (GraphTraversalImpl.this)#ElemOrdering, Option[(GraphTraversalImpl.this)#Weight]) ⇒ (GraphTraversalImpl.this)#ComponentTraverser
- Attributes
- protected
- Definition Classes
- ComponentTraverser → FluentProperties
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
val
ordering: (GraphTraversalImpl.this)#ElemOrdering
- Definition Classes
- ComponentTraverser → Properties
-
def
par: ParIterable[(GraphTraversalImpl.this)#Component]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[(GraphTraversalImpl.this)#Component, ParIterable[(GraphTraversalImpl.this)#Component]]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike → Parallelizable
-
val
parameters: Parameters
- Definition Classes
- ComponentTraverser → Properties
-
def
partition(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): (Traversable[(GraphTraversalImpl.this)#Component], Traversable[(GraphTraversalImpl.this)#Component])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
product[B >: (GraphTraversalImpl.this)#Component](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: (GraphTraversalImpl.this)#Component](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: (GraphTraversalImpl.this)#Component](op: (B, (GraphTraversalImpl.this)#Component) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: (GraphTraversalImpl.this)#Component](op: (B, (GraphTraversalImpl.this)#Component) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: (GraphTraversalImpl.this)#Component](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: (GraphTraversalImpl.this)#Component](op: ((GraphTraversalImpl.this)#Component, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: (GraphTraversalImpl.this)#Component](op: ((GraphTraversalImpl.this)#Component, B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
repr: Traversable[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reversed: List[(GraphTraversalImpl.this)#Component]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
val
root: (GraphTraversalImpl.this)#NodeT
- Definition Classes
- ComponentTraverser → Properties
-
def
scan[B >: (GraphTraversalImpl.this)#Component, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#Component], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, (GraphTraversalImpl.this)#Component) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#Component], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: ((GraphTraversalImpl.this)#Component, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(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.
-
def
seq: Traversable[(GraphTraversalImpl.this)#Component]
- Definition Classes
- Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): Traversable[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
span(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): (Traversable[(GraphTraversalImpl.this)#Component], Traversable[(GraphTraversalImpl.this)#Component])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (Traversable[(GraphTraversalImpl.this)#Component], Traversable[(GraphTraversalImpl.this)#Component])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
stringPrefix: String
- Definition Classes
- TraversableLike → GenTraversableLike
-
val
subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter
- Definition Classes
- ComponentTraverser → SubgraphProperties
-
val
subgraphNodes: (GraphTraversalImpl.this)#NodeFilter
- Definition Classes
- ComponentTraverser → SubgraphProperties
-
def
sum[B >: (GraphTraversalImpl.this)#Component](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: Traversable[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[Traversable[(GraphTraversalImpl.this)#Component]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): Traversable[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
takeWhile(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
thisCollection: Traversable[(GraphTraversalImpl.this)#Component]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (GraphTraversalImpl.this)#Component, Col[(GraphTraversalImpl.this)#Component]]): Col[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: (GraphTraversalImpl.this)#Component](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[B >: (GraphTraversalImpl.this)#Component]: Buffer[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: Traversable[(GraphTraversalImpl.this)#Component]): Traversable[(GraphTraversalImpl.this)#Component]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
toIndexedSeq: IndexedSeq[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
toInnerElemTraverser(root: (GraphTraversalImpl.this)#NodeT): (GraphTraversalImpl.this)#InnerElemTraverser
- Definition Classes
- FluentProperties
-
def
toIterable: Iterable[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toList: List[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[(GraphTraversalImpl.this)#Component, (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toParArray: ParArray[T]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to CollectionsHaveToParArray[(GraphTraversalImpl.this)#ComponentTraverser, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type ((GraphTraversalImpl.this)#ComponentTraverser) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
-
def
toSeq: Seq[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSet[B >: (GraphTraversalImpl.this)#Component]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- TraversableLike → Any
-
def
toTraversable: Traversable[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[(GraphTraversalImpl.this)#Component]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
topologicalSort[U](implicit visitor: ((GraphTraversalImpl.this)#InnerElem) ⇒ U = empty): (GraphTraversalImpl.this)#CycleNodeOrTopologicalOrder
See GraphTraversal#topologicalSort.
- Definition Classes
- ComponentTraverser → ComponentTraverser
-
final
def
topologicalSortByComponent[U](implicit visitor: ((GraphTraversalImpl.this)#InnerElem) ⇒ U = empty): Traversable[(GraphTraversalImpl.this)#CycleNodeOrTopologicalOrder]
See GraphTraversal#topologicalSortByComponent.
- Definition Classes
- ComponentTraverser → ComponentTraverser
-
def
transpose[B](implicit asTraversable: ((GraphTraversalImpl.this)#Component) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transpose
throws anIllegalArgumentException
if collections are not uniformly sized.
-
def
unzip[A1, A2](implicit asPair: ((GraphTraversalImpl.this)#Component) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: ((GraphTraversalImpl.this)#Component) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
- Definition Classes
- GenericTraversableTemplate
-
val
value: (GraphTraversalImpl.this)#ComponentTraverser
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to OuterNode[(GraphTraversalImpl.this)#ComponentTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- OuterNode → NodeParam
-
def
view(from: Int, until: Int): TraversableView[(GraphTraversalImpl.this)#Component, Traversable[(GraphTraversalImpl.this)#Component]]
- Definition Classes
- TraversableLike
-
def
view: TraversableView[(GraphTraversalImpl.this)#Component, Traversable[(GraphTraversalImpl.this)#Component]]
- Definition Classes
- TraversableLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
withDirection(direction: Direction): (GraphTraversalImpl.this)#ComponentTraverser
Creates a new FluentProperties based on
this
except for an updateddirection
.Creates a new FluentProperties based on
this
except for an updateddirection
. Note that methods returning a Cycle or Path accept onlySuccessors
.- Definition Classes
- FluentProperties
-
def
withFilter(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): FilterMonadic[(GraphTraversalImpl.this)#Component, Traversable[(GraphTraversalImpl.this)#Component]]
- Definition Classes
- TraversableLike → FilterMonadic
-
final
def
withKind(kind: Kind): (GraphTraversalImpl.this)#ComponentTraverser
Creates a new FluentProperties based on
this
except for an updatedkind
.Creates a new FluentProperties based on
this
except for an updatedkind
.- Definition Classes
- FluentProperties
-
final
def
withMaxDepth(maxDepth: Int): (GraphTraversalImpl.this)#ComponentTraverser
Creates a new FluentProperties based on
this
except for an updatedmaxDepth
.Creates a new FluentProperties based on
this
except for an updatedmaxDepth
.- Definition Classes
- FluentProperties
-
final
def
withMaxWeight(max: Long): (GraphTraversalImpl.this)#ComponentTraverser
Creates a new FluentProperties based on
this
except for an updatedmaxWeight
having the givenmax
and the default weight function returningedge.weight
.Creates a new FluentProperties based on
this
except for an updatedmaxWeight
having the givenmax
and the default weight function returningedge.weight
.- Definition Classes
- FluentProperties
-
final
def
withMaxWeight[W](max: W, edgeWeight: ((GraphTraversalImpl.this)#EdgeT) ⇒ W)(implicit arg0: Numeric[W]): (GraphTraversalImpl.this)#ComponentTraverser
Creates a new FluentProperties based on
this
except for an updatedmaxWeight
having the givenmax
value and the given weight function.Creates a new FluentProperties based on
this
except for an updatedmaxWeight
having the givenmax
value and the given weight function.- Definition Classes
- FluentProperties
-
def
withMaxWeight(maxWeight: Option[(GraphTraversalImpl.this)#Weight]): (GraphTraversalImpl.this)#ComponentTraverser
Creates a new FluentProperties based on
this
except for an updatedmaxWeight
.Creates a new FluentProperties based on
this
except for an updatedmaxWeight
.- Definition Classes
- FluentProperties
-
final
def
withOrdering(ordering: (GraphTraversalImpl.this)#ElemOrdering): (GraphTraversalImpl.this)#ComponentTraverser
Creates a new FluentProperties based on
this
except for an updatedordering
.Creates a new FluentProperties based on
this
except for an updatedordering
.- Definition Classes
- FluentProperties
-
final
def
withParameters(parameters: Parameters): (GraphTraversalImpl.this)#ComponentTraverser
Creates a new FluentProperties based on
this
except for an updatedparameters
.Creates a new FluentProperties based on
this
except for an updatedparameters
.- Definition Classes
- FluentProperties
-
final
def
withSubgraph(nodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, edges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge): (GraphTraversalImpl.this)#ComponentTraverser
Creates a new FluentProperties based on
this
except for an updatedsubgraphNodes
and/orsubgraphEdges
.Creates a new FluentProperties based on
this
except for an updatedsubgraphNodes
and/orsubgraphEdges
.- Definition Classes
- FluentProperties
-
def
~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to EdgeAssoc[(GraphTraversalImpl.this)#ComponentTraverser] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
-
def
~>[N >: N1](n2: N): DiEdge[N]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to EdgeAssoc[(GraphTraversalImpl.this)#ComponentTraverser] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
-
def
→[B](y: B): ((GraphTraversalImpl.this)#ComponentTraverser, B)
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to ArrowAssoc[(GraphTraversalImpl.this)#ComponentTraverser] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
Shadowed Implicit Value Members
-
def
filter(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): TraversableOnce[(GraphTraversalImpl.this)#Component]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser 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:(componentTraverser: MonadOps[(GraphTraversalImpl.this)#Component]).filter(p)
- Definition Classes
- MonadOps
-
def
flatMap[B](f: ((GraphTraversalImpl.this)#Component) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser 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:(componentTraverser: MonadOps[(GraphTraversalImpl.this)#Component]).flatMap(f)
- Definition Classes
- MonadOps
-
def
map[B](f: ((GraphTraversalImpl.this)#Component) ⇒ B): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser 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:(componentTraverser: MonadOps[(GraphTraversalImpl.this)#Component]).map(f)
- Definition Classes
- MonadOps
-
def
stringPrefix: String
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to OuterNode[(GraphTraversalImpl.this)#ComponentTraverser] 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:(componentTraverser: OuterNode[(GraphTraversalImpl.this)#ComponentTraverser]).stringPrefix
- Definition Classes
- NodeParam
-
def
toString(): String
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser to OuterNode[(GraphTraversalImpl.this)#ComponentTraverser] 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:(componentTraverser: OuterNode[(GraphTraversalImpl.this)#ComponentTraverser]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
-
def
withFilter(p: ((GraphTraversalImpl.this)#Component) ⇒ Boolean): Iterator[(GraphTraversalImpl.this)#Component]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#ComponentTraverser 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:(componentTraverser: MonadOps[(GraphTraversalImpl.this)#Component]).withFilter(p)
- Definition Classes
- MonadOps
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graph
mutable.Graph
and its inner nodes.GraphEdge
objectedge
packageGraphPredef
object andImplicits
object.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.