StrongComponentTraverser

scalax.collection.GraphTraversal.StrongComponentTraverser
abstract class StrongComponentTraverser() extends Iterable[Component]

Controls the properties of graph traversals with no specific root and allows you to produce the strongly connected components by a traversal.

Attributes

Graph
Supertypes
Known subtypes

Members list

Value members

Inherited methods

final def ++[B >: Component](suffix: IterableOnce[B]): CC[B]

Attributes

Inherited from:
IterableOps

Attributes

Inherited from:
IterableOnceOps

Attributes

Inherited from:
IterableOnceOps

Attributes

Inherited from:
IterableOps

Attributes

Inherited from:
IterableOnceOps
def concat[B >: Component](suffix: IterableOnce[B]): CC[B]

Attributes

Inherited from:
IterableOps

Attributes

Inherited from:
IterableOnceOps

Attributes

Inherited from:
IterableOnceOps
def copyToArray[B >: Component](xs: Array[B]): Int

Attributes

Inherited from:
IterableOnceOps

Attributes

Inherited from:
IterableOnceOps

Attributes

Inherited from:
IterableOnceOps
def drop(n: Int): C

Attributes

Inherited from:
IterableOps
def dropRight(n: Int): C

Attributes

Inherited from:
IterableOps

Attributes

Inherited from:
IterableOps
override def empty: CC[A]

Attributes

Definition Classes
Inherited from:
IterableFactoryDefaults

Attributes

Inherited from:
IterableOnceOps

Attributes

Inherited from:
IterableOps

Attributes

Inherited from:
IterableOps
def find(p: Component => Boolean): Option[A]

Attributes

Inherited from:
IterableOnceOps
def flatMap[B](f: Component => IterableOnce[B]): CC[B]

Attributes

Inherited from:
IterableOps
def flatten[B](implicit asIterable: Component => IterableOnce[B]): CC[B]

Attributes

Inherited from:
IterableOps
def fold[A1 >: Component](z: A1)(op: (A1, A1) => A1): A1

Attributes

Inherited from:
IterableOnceOps
def foldLeft[B](z: B)(op: (B, Component) => B): B

Attributes

Inherited from:
IterableOnceOps
def foldRight[B](z: B)(op: (Component, B) => B): B

Attributes

Inherited from:
IterableOnceOps

Attributes

Inherited from:
IterableOnceOps
def foreach[U](f: Component => U): Unit

Attributes

Inherited from:
IterableOnceOps
protected def fromSpecific(coll: IterableOnce[Component]): CC[A]

Attributes

Inherited from:
IterableFactoryDefaults
def groupBy[K](f: Component => K): Map[K, C]

Attributes

Inherited from:
IterableOps
def groupMap[K, B](key: Component => K)(f: Component => B): Map[K, CC[B]]

Attributes

Inherited from:
IterableOps
def groupMapReduce[K, B](key: Component => K)(f: Component => B)(reduce: (B, B) => B): Map[K, B]

Attributes

Inherited from:
IterableOps
def grouped(size: Int): Iterator[C]

Attributes

Inherited from:
IterableOps
def head: A

Attributes

Inherited from:
IterableOps
def headOption: Option[A]

Attributes

Inherited from:
IterableOps
def init: C

Attributes

Inherited from:
IterableOps
def inits: Iterator[C]

Attributes

Inherited from:
IterableOps

Attributes

Inherited from:
IterableOnceOps
override def isTraversableAgain: Boolean

Attributes

Definition Classes
Inherited from:
IterableOps

Attributes

Inherited from:
Iterable
def iterator: Iterator[A]

Attributes

Inherited from:
IterableOnce
def knownSize: Int

Attributes

Inherited from:
IterableOnce
def last: A

Attributes

Inherited from:
IterableOps
def lastOption: Option[A]

Attributes

Inherited from:
IterableOps

Attributes

Inherited from:
Iterable
def map[B](f: Component => B): CC[B]

Attributes

Inherited from:
IterableOps
def max[B >: Component](implicit ord: Ordering[B]): A

Attributes

Inherited from:
IterableOnceOps
def maxBy[B](f: Component => B)(implicit ord: Ordering[B]): A

Attributes

Inherited from:
IterableOnceOps
def maxByOption[B](f: Component => B)(implicit ord: Ordering[B]): Option[A]

Attributes

Inherited from:
IterableOnceOps
def maxOption[B >: Component](implicit ord: Ordering[B]): Option[A]

Attributes

Inherited from:
IterableOnceOps

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.

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.

Attributes

Inherited from:
Properties (hidden)
def min[B >: Component](implicit ord: Ordering[B]): A

Attributes

Inherited from:
IterableOnceOps
def minBy[B](f: Component => B)(implicit ord: Ordering[B]): A

Attributes

Inherited from:
IterableOnceOps
def minByOption[B](f: Component => B)(implicit ord: Ordering[B]): Option[A]

Attributes

Inherited from:
IterableOnceOps
def minOption[B >: Component](implicit ord: Ordering[B]): Option[A]

Attributes

Inherited from:
IterableOnceOps
final def mkString: String

Attributes

Inherited from:
IterableOnceOps
final def mkString(sep: String): String

Attributes

Inherited from:
IterableOnceOps

Attributes

Inherited from:
IterableOnceOps
protected def newSpecificBuilder: Builder[A, CC[A]]

Attributes

Inherited from:
IterableFactoryDefaults
protected def newTraverser: (NodeT, Parameters, NodePredicate, EdgePredicate, ElemOrdering, Option[Weight]) => C

Attributes

Inherited from:
FluentProperties (hidden)

Attributes

Inherited from:
IterableOnceOps
def ordering: 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.

Attributes

Inherited from:
Properties (hidden)

The properties controlling subsequent traversals.

The properties controlling subsequent traversals.

Attributes

Inherited from:
Properties (hidden)
def partition(p: Component => Boolean): (C, C)

Attributes

Inherited from:
IterableOps
def partitionMap[A1, A2](f: Component => Either[A1, A2]): (CC[A1], CC[A2])

Attributes

Inherited from:
IterableOps
def product[B >: Component](implicit num: Numeric[B]): B

Attributes

Inherited from:
IterableOnceOps
def reduce[B >: Component](op: (B, B) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceLeft[B >: Component](op: (B, Component) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceLeftOption[B >: Component](op: (B, Component) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
def reduceOption[B >: Component](op: (B, B) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
def reduceRight[B >: Component](op: (Component, B) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceRightOption[B >: Component](op: (Component, B) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
protected def reversed: Iterable[A]

Attributes

Inherited from:
IterableOnceOps
def root: NodeT

The node where subsequent graph traversals start.

The node where subsequent graph traversals start.

Attributes

Inherited from:
Properties (hidden)
def scan[B >: Component](z: B)(op: (B, B) => B): CC[B]

Attributes

Inherited from:
IterableOps
def scanLeft[B](z: B)(op: (B, Component) => B): CC[B]

Attributes

Inherited from:
IterableOps
def scanRight[B](z: B)(op: (Component, B) => B): CC[B]

Attributes

Inherited from:
IterableOps
def size: Int

Attributes

Inherited from:
IterableOnceOps

Attributes

Inherited from:
IterableOps

Attributes

Inherited from:
IterableOps
final def sizeIs: SizeCompareOps

Attributes

Inherited from:
IterableOps
def slice(from: Int, until: Int): C

Attributes

Inherited from:
IterableOps

Attributes

Inherited from:
IterableOps
def sliding(size: Int): Iterator[C]

Attributes

Inherited from:
IterableOps
def span(p: Component => Boolean): (C, C)

Attributes

Inherited from:
IterableOps
override def splitAt(n: Int): (C, C)

Attributes

Definition Classes
Inherited from:
IterableOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[Component, S]): S

Attributes

Inherited from:
IterableOnce

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.

Attributes

Inherited from:
SubgraphProperties (hidden)

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

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

Attributes

Inherited from:
SubgraphProperties (hidden)
def sum[B >: Component](implicit num: Numeric[B]): B

Attributes

Inherited from:
IterableOnceOps
def tail: C

Attributes

Inherited from:
IterableOps
def tails: Iterator[C]

Attributes

Inherited from:
IterableOps
def take(n: Int): C

Attributes

Inherited from:
IterableOps
def takeRight(n: Int): C

Attributes

Inherited from:
IterableOps

Attributes

Inherited from:
IterableOps
override def tapEach[U](f: Component => U): C

Attributes

Definition Classes
Inherited from:
IterableOps
def to[C1](factory: Factory[Component, C1]): C1

Attributes

Inherited from:
IterableOnceOps

Attributes

Inherited from:
IterableOnceOps
final def toBuffer[B >: Component]: Buffer[B]

Attributes

Inherited from:
IterableOnceOps

Attributes

Inherited from:
IterableOnceOps
final def toInnerElemTraverser(root: NodeT): InnerElemTraverser

Attributes

Inherited from:
FluentProperties (hidden)
def toList: List[A]

Attributes

Inherited from:
IterableOnceOps
def toMap[K, V](implicit ev: Component <:< (K, V)): Map[K, V]

Attributes

Inherited from:
IterableOnceOps
def toSeq: Seq[A]

Attributes

Inherited from:
IterableOnceOps
def toSet[B >: Component]: Set[B]

Attributes

Inherited from:
IterableOnceOps
override def toString(): String

Returns a string representation of the object.

Returns a string representation of the object.

The default representation is platform dependent.

Attributes

Returns

a string representation of the object.

Definition Classes
Iterable -> Any
Inherited from:
Iterable
def toVector: Vector[A]

Attributes

Inherited from:
IterableOnceOps
def transpose[B](implicit asIterable: Component => Iterable[B]): CC[CC[B]]

Attributes

Inherited from:
IterableOps
def unzip[A1, A2](implicit asPair: Component => (A1, A2)): (CC[A1], CC[A2])

Attributes

Inherited from:
IterableOps
def unzip3[A1, A2, A3](implicit asTriple: Component => (A1, A2, A3)): (CC[A1], CC[A2], CC[A3])

Attributes

Inherited from:
IterableOps
def view: View[A]

Attributes

Inherited from:
IterableOps
final def withDirection(direction: Direction): C

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

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

Attributes

Inherited from:
FluentProperties (hidden)

Attributes

Inherited from:
IterableOps
final def withKind(kind: Kind): C

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

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

Attributes

Inherited from:
FluentProperties (hidden)
final def withMaxDepth(maxDepth: Int): C

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

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

Attributes

Inherited from:
FluentProperties (hidden)
final def withMaxWeight(max: Long): C

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.

Attributes

Inherited from:
FluentProperties (hidden)
final def withMaxWeight[W : Numeric](max: W, edgeWeight: EdgeT => W): C

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.

Attributes

Inherited from:
FluentProperties (hidden)
def withMaxWeight(maxWeight: Option[Weight]): C

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

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

Attributes

Inherited from:
FluentProperties (hidden)
final def withOrdering(ordering: ElemOrdering): C

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

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

Attributes

Inherited from:
FluentProperties (hidden)
final def withParameters(parameters: Parameters): C

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

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

Attributes

Inherited from:
FluentProperties (hidden)
final def withSubgraph(nodes: NodePredicate, edges: EdgePredicate): C

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.

Attributes

Inherited from:
FluentProperties (hidden)
def zip[B](that: IterableOnce[B]): CC[(A, B)]

Attributes

Inherited from:
IterableOps
def zipAll[A1 >: Component, B](that: Iterable[B], thisElem: A1, thatElem: B): CC[(A1, B)]

Attributes

Inherited from:
IterableOps
def zipWithIndex: CC[(A, Int)]

Attributes

Inherited from:
IterableOps

Deprecated and Inherited methods

def ++:[B >: Component](that: IterableOnce[B]): CC[B]

Attributes

Deprecated
[Since version 2.13.0] Use ++ instead of ++: for collections of type Iterable
Inherited from:
IterableOps
final def /:[B](z: B)(op: (B, Component) => B): B

Attributes

Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from:
IterableOnceOps
final def :\[B](z: B)(op: (Component, B) => B): B

Attributes

Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from:
IterableOnceOps
def aggregate[B](z: => B)(seqop: (B, Component) => B, combop: (B, B) => B): B

Attributes

Deprecated
[Since version 2.13.0] `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.
Inherited from:
IterableOnceOps

Attributes

Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from:
IterableOps
final def copyToBuffer[B >: Component](dest: Buffer[B]): Unit

Attributes

Deprecated
[Since version 2.13.0] Use `dest ++= coll` instead
Inherited from:
IterableOnceOps

Attributes

Deprecated
[Since version 2.13.0] Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
Inherited from:
IterableOnceOps
final def repr: C

Attributes

Deprecated
[Since version 2.13.0] Use coll instead of repr in a collection implementation, use the collection value itself from the outside
Inherited from:
IterableOps
def seq: Iterable.this.type

Attributes

Deprecated
[Since version 2.13.0] Iterable.seq always returns the iterable itself
Inherited from:
Iterable
final def toIterable: Iterable.this.type

Attributes

Deprecated
[Since version 2.13.7] toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
Iterable
final def toIterator: Iterator[A]

Attributes

Deprecated
[Since version 2.13.0] Use .iterator instead of .toIterator
Inherited from:
IterableOnceOps
final def toStream: Stream[A]

Attributes

Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from:
IterableOnceOps
final def toTraversable: Iterable[A]

Attributes

Deprecated
[Since version 2.13.0] toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
IterableOps
def view(from: Int, until: Int): View[A]

Attributes

Deprecated
[Since version 2.13.0] Use .view.slice(from, until) instead of .view(from, until)
Inherited from:
IterableOps