ComponentTraverser

abstract def findCycle[U](implicit visitor: (GraphTraversal.InnerElem) ⇒ U = empty): Option[Cycle]

abstract def foreach[U](f: (Component) ⇒ U): Unit

abstract def newTraverser: (NodeT, Parameters, (NodeT) ⇒ Boolean, (GraphTraversal.EdgeT) ⇒ Boolean, GraphTraversal.ElemOrdering) ⇒ ComponentTraverser

abstract def ordering: GraphTraversal.ElemOrdering

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

abstract def parameters: Parameters

The properties controlling subsequent traversals.

abstract def root: NodeT

The node where subsequent graph traversals start.

abstract def subgraphEdges: (GraphTraversal.EdgeT) ⇒ Boolean

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

abstract def subgraphNodes: (NodeT) ⇒ Boolean

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

abstract def topologicalSort[U](implicit visitor: (NodeT) ⇒ U = empty): List[N]

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ++[B >: Component, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Component], B, That]): That

def ++:[B >: Component, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[Component], B, That]): That

def ++:[B >: Component, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Component], B, That]): That

def ->[B](y: B): (ComponentTraverser, B)

def /:[B](z: B)(op: (B, Component) ⇒ B): B

def :\[B](z: B)(op: (Component, B) ⇒ B): B

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

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

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

def aggregate[B](z: ⇒ B)(seqop: (B, Component) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Component, B])(implicit bf: CanBuildFrom[Traversable[Component], B, That]): That

def collectFirst[B](pf: PartialFunction[Component, B]): Option[B]

def companion: GenericCompanion[Traversable]

def copyToArray[B >: Component](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: Component](xs: Array[B]): Unit

def copyToArray[B >: Component](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: Component](dest: Buffer[B]): Unit

def count(p: (Component) ⇒ Boolean): Int

def drop(n: Int): Traversable[Component]

def dropWhile(p: (Component) ⇒ Boolean): Traversable[Component]

def ensuring(cond: (ComponentTraverser) ⇒ Boolean, msg: ⇒ Any): ComponentTraverser

def ensuring(cond: (ComponentTraverser) ⇒ Boolean): ComponentTraverser

def ensuring(cond: Boolean, msg: ⇒ Any): ComponentTraverser

def ensuring(cond: Boolean): ComponentTraverser

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (Component) ⇒ Boolean): Boolean

def filter(p: (Component) ⇒ Boolean): Traversable[Component]

def filterNot(p: (Component) ⇒ Boolean): Traversable[Component]

def finalize(): Unit

def find(p: (Component) ⇒ Boolean): Option[Component]

def flatMap[B, That](f: (Component) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Component], B, That]): That

def flatten[B](implicit asTraversable: (Component) ⇒ GenTraversableOnce[B]): Traversable[B]

def fold[A1 >: Component](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, Component) ⇒ B): B

def foldRight[B](z: B)(op: (Component, B) ⇒ B): B

def forall(p: (Component) ⇒ Boolean): Boolean

def formatted(fmtstr: String): String

def genericBuilder[B]: Builder[B, Traversable[B]]

final def getClass(): Class[_]

def groupBy[K](f: (Component) ⇒ K): Map[K, Traversable[Component]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Component

def headOption: Option[Component]

def init: Traversable[Component]

def inits: Iterator[Traversable[Component]]

def isDefined: Boolean

def isEdge: Boolean

def isEmpty: Boolean

def isIn: Boolean

final def isInstanceOf[T0]: Boolean

def isNode: Boolean

def isOut: Boolean

final def isTraversableAgain: Boolean

def last: Component

def lastOption: Option[Component]

def map[B, That](f: (Component) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Component], B, That]): That

def max[B >: Component](implicit cmp: Ordering[B]): Component

def maxBy[B](f: (Component) ⇒ B)(implicit cmp: Ordering[B]): Component

def min[B >: Component](implicit cmp: Ordering[B]): Component

def minBy[B](f: (Component) ⇒ B)(implicit cmp: Ordering[B]): Component

def mkString: String

def mkString(sep: String): String

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

val n1: ComponentTraverser

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[Component, Traversable[Component]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[Component]

def parCombiner: Combiner[Component, ParIterable[Component]]

def partition(p: (Component) ⇒ Boolean): (Traversable[Component], Traversable[Component])

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

def reduce[A1 >: Component](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: Component](op: (B, Component) ⇒ B): B

def reduceLeftOption[B >: Component](op: (B, Component) ⇒ B): Option[B]

def reduceOption[A1 >: Component](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: Component](op: (Component, B) ⇒ B): B

def reduceRightOption[B >: Component](op: (Component, B) ⇒ B): Option[B]

def repr: Traversable[Component]

def reversed: List[Component]

def scan[B >: Component, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[Component], B, That]): That

def scanLeft[B, That](z: B)(op: (B, Component) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Component], B, That]): That

def scanRight[B, That](z: B)(op: (Component, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Component], B, That]): That

def seq: Traversable[Component]

def size: Int

def slice(from: Int, until: Int): Traversable[Component]

def span(p: (Component) ⇒ Boolean): (Traversable[Component], Traversable[Component])

def splitAt(n: Int): (Traversable[Component], Traversable[Component])

def stringPrefix: String

def sum[B >: Component](implicit num: Numeric[B]): B

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

def tail: Traversable[Component]

def tails: Iterator[Traversable[Component]]

def take(n: Int): Traversable[Component]

def takeWhile(p: (Component) ⇒ Boolean): Traversable[Component]

def thisCollection: Traversable[Component]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Component, Col[Component]]): Col[Component]

def toArray[B >: Component](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: Component]: Buffer[B]

def toCollection(repr: Traversable[Component]): Traversable[Component]

def toIndexedSeq: IndexedSeq[Component]

final def toInnerElemTraverser(root: NodeT): InnerElemTraverser

def toIterable: Iterable[Component]

def toIterator: Iterator[Component]

def toList: List[Component]

def toMap[T, U](implicit ev: <:<[Component, (T, U)]): Map[T, U]

def toParArray: ParArray[T]

def toSeq: Seq[Component]

def toSet[B >: Component]: Set[B]

def toStream: Stream[Component]

def toString(): String

def toTraversable: Traversable[Component]

def toVector: Vector[Component]

def transpose[B](implicit asTraversable: (Component) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]

def unzip[A1, A2](implicit asPair: (Component) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (Component) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])

val value: ComponentTraverser

def view(from: Int, until: Int): TraversableView[Component, Traversable[Component]]

def view: TraversableView[Component, Traversable[Component]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

final def withDirection(direction: Direction): ComponentTraverser

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

def withFilter(p: (Component) ⇒ Boolean): FilterMonadic[Component, Traversable[Component]]

final def withKind(kind: Kind): ComponentTraverser

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

final def withMaxDepth(maxDepth: Int): ComponentTraverser

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

final def withOrdering(ordering: GraphTraversal.ElemOrdering): ComponentTraverser

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

final def withParameters(parameters: Parameters): ComponentTraverser

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

final def withSubgraph(nodes: (NodeT) ⇒ Boolean = anyNode, edges: (GraphTraversal.EdgeT) ⇒ Boolean = anyEdge): ComponentTraverser

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

def ~[N >: N1, N2 <: N](n2: N2): UnDiEdge[N]

def ~>[N >: N1, N2 <: N](n2: N2): DiEdge[N]

def →[B](y: B): (ComponentTraverser, B)

def filter(p: (Component) ⇒ Boolean): TraversableOnce[Component]

def flatMap[B](f: (Component) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

def map[B](f: (Component) ⇒ B): TraversableOnce[B]

def stringPrefix: String

def toString(): String

def withFilter(p: (Component) ⇒ Boolean): Iterator[Component]