Impl

abstract def edgeVisitor[U](f: (A) ⇒ U): (GraphTraversalImpl.EdgeT) ⇒ U

abstract def newTraverser: (NodeT, Parameters, (NodeT) ⇒ Boolean, (GraphTraversalImpl.EdgeT) ⇒ Boolean, GraphTraversalImpl.ElemOrdering) ⇒ This

abstract def nodeVisitor[U](f: (A) ⇒ U): (NodeT) ⇒ U

abstract def ordering: GraphTraversalImpl.ElemOrdering

$ORD

abstract def parameters: Parameters

$PARAMETERS

abstract def root: NodeT

$ROOT

abstract def subgraphEdges: (GraphTraversalImpl.EdgeT) ⇒ Boolean

$SUBGRAPHEDGES

abstract def subgraphNodes: (NodeT) ⇒ Boolean

$SUBGRAPHNODES

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

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

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

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

def ->[B](y: B): (GraphTraversalImpl.Impl[A, This], B)

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

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

object Runner

final val addMethod: (NodeT, GraphTraversalImpl.EdgeT, (NodeT) ⇒ Unit) ⇒ Unit

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, A) ⇒ B, combop: (B, B) ⇒ B): B

final def apply[U](pred: (NodeT) ⇒ Boolean = noNode, visitor: (A) ⇒ U = empty): Option[NodeT]

final def asInstanceOf[T0]: T0

def asParIterable: ParIterable[A]

def asParSeq: ParSeq[A]

def clone(): AnyRef

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

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

def companion: GenericCompanion[Traversable]

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

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

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

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

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

final val doEdgeFilter: Boolean

final val doEdgeSort: Boolean

final val doNodeFilter: Boolean

final val doNodeSort: Boolean

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

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

final val edgeOrdering: GraphTraversalImpl.EdgeOrdering

def ensuring(cond: (GraphTraversalImpl.Impl[A, This]) ⇒ Boolean, msg: ⇒ Any): GraphTraversalImpl.Impl[A, This]

def ensuring(cond: (GraphTraversalImpl.Impl[A, This]) ⇒ Boolean): GraphTraversalImpl.Impl[A, This]

def ensuring(cond: Boolean, msg: ⇒ Any): GraphTraversalImpl.Impl[A, This]

def ensuring(cond: Boolean): GraphTraversalImpl.Impl[A, This]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

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

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

def finalize(): Unit

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

final def findConnected[U](pred: (NodeT) ⇒ Boolean)(implicit visitor: (A) ⇒ U = empty): Option[NodeT]

Finds a node connected with root by any number of edges with any direction for which the predicate pred holds $CONSIDERING For directed or mixed graphs the node to be found is weekly connected with this node.

final def findCycle[U](implicit visitor: (A) ⇒ U = empty): Option[GraphTraversalImpl.Cycle]

Finds a cycle starting the search at root $INTOACC, if any.

final def findPredecessor[U](pred: (NodeT) ⇒ Boolean)(implicit visitor: (A) ⇒ U = empty): Option[NodeT]

Finds a predecessor of root for which the predicate pred holds $CONSIDERING root itself does not count as a match.

final def findSuccessor[U](pred: (NodeT) ⇒ Boolean)(implicit visitor: (A) ⇒ U = empty): Option[NodeT]

Finds a successor of root for which the predicate pred holds $CONSIDERING root itself does not count as a match.

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

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

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

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

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

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

def foreach[U](f: (A) ⇒ U): Unit

def formatted(fmtstr: String): String

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

final def getClass(): Class[_]

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

def hasDefiniteSize: Boolean

final def hasPredecessor[U](potentialPredecessor: NodeT)(implicit visitor: (A) ⇒ U = empty): Boolean

Checks whether potentialPredecessor is a predecessor of root $CONSIDERING Same as isSuccessorOf.

final def hasSuccessor[U](potentialSuccessor: NodeT)(implicit visitor: (A) ⇒ U = empty): Boolean

Checks whether potentialSuccessor is a successor of this node $CONSIDERING Same as isPredecessorOf.

def hashCode(): Int

def head: A

def headOption: Option[A]

def ifParSeq[R](isbody: (ParSeq[A]) ⇒ R): (TraversableOps[A])#Otherwise[R]

def init: Traversable[A]

def inits: Iterator[Traversable[A]]

final def isConnectedWith[U](potentialConnected: NodeT)(implicit visitor: (A) ⇒ U = empty): Boolean

Checks whether potentialConnected is a node (not necessarily directly) connected with root by any number of edges with any direction $CONSIDERING For directed or mixed graphs it is satisfactory that potentialConnected is weekly connected with root.

def isDefined: Boolean

def isEdge: Boolean

def isEmpty: Boolean

def isIn: Boolean

final def isInstanceOf[T0]: Boolean

def isNode: Boolean

def isOut: Boolean

def isParIterable: Boolean

def isParSeq: Boolean

def isParallel: Boolean

final def isPredecessorOf[U](potentialSuccessor: NodeT)(implicit visitor: (A) ⇒ U = empty): Boolean

Same as hasSuccessor.

final def isSuccessorOf[U](potentialPredecessor: NodeT)(implicit visitor: (A) ⇒ U = empty): Boolean

Same as hasPredecessor.

final def isTraversableAgain: Boolean

def last: A

def lastOption: Option[A]

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

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

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

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

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

def mkString: String

def mkString(sep: String): String

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

val n1: GraphTraversalImpl.Impl[A, This]

final def ne(arg0: AnyRef): Boolean

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

final val nodeOrdering: GraphTraversalImpl.NodeOrdering

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[A]

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

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

final def pathTo[U](potentialSuccessor: NodeT)(implicit visitor: (A) ⇒ U = empty): Option[GraphTraversalImpl.Path]

Finds a path from root to potentialSuccessor $CONSIDERING

final def pathUntil[U](pred: (NodeT) ⇒ Boolean)(implicit visitor: (A) ⇒ U = empty): Option[GraphTraversalImpl.Path]

Finds a path from root to a successor of root for which pred holds $CONSIDERING root itself does not count as a match.

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

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

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

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

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

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

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

def repr: Traversable[A]

final val reverseEdgeOrdering: Ordering[GraphTraversalImpl.EdgeT]

final val reverseNodeOrdering: Ordering[NodeT]

def reversed: List[A]

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

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

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

def seq: Traversable[A]

final def shortestPathTo[T, U](potentialSuccessor: NodeT, weight: (GraphTraversalImpl.EdgeT) ⇒ T, visitor: (A) ⇒ U)(implicit arg0: Numeric[T]): Option[GraphTraversalImpl.Path]

Finds the shortest path from root to potentialSuccessor $CONSIDERING The calculation is based on the weight of the edges on the path.

final def shortestPathTo[T](potentialSuccessor: NodeT, weight: (GraphTraversalImpl.EdgeT) ⇒ T)(implicit arg0: Numeric[T]): Option[GraphTraversalImpl.Path]

Finds the shortest path from root to potentialSuccessor $CONSIDERING The calculation is based on the weight of the edges on the path.

final def shortestPathTo[U](potentialSuccessor: NodeT)(implicit visitor: (A) ⇒ U = empty): Option[GraphTraversalImpl.Path]

Finds the shortest path from root to potentialSuccessor $CONSIDERING The calculation is based on the weight of the edges on the path.

def size: Int

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

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

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

def stringPrefix: String

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

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

def tail: Traversable[A]

def tails: Iterator[Traversable[A]]

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

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

def thisCollection: Traversable[A]

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

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

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

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

final def toGraph: Graph[N, E]

Completes a traversal and creates a new connected graph populated with the elements visited.

def toIndexedSeq: IndexedSeq[A]

final def toInnerElemTraverser(root: NodeT): GraphTraversalImpl.InnerElemTraverser

def toIterable: Iterable[A]

def toIterator: Iterator[A]

def toList: List[A]

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

def toParArray: ParArray[A]

def toSeq: Seq[A]

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

def toStream: Stream[A]

def toString(): String

def toTraversable: Traversable[A]

def toVector: Vector[A]

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

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

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

val value: GraphTraversalImpl.Impl[A, This]

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

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

final def withDirection(direction: Direction): This

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

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

final def withKind(kind: Kind): This

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

final def withMaxDepth(maxDepth: Int): This

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

final def withOrdering(ordering: GraphTraversalImpl.ElemOrdering): This

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

final def withParameters(parameters: Parameters): This

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

final def withRoot(root: NodeT): This

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

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

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): (GraphTraversalImpl.Impl[A, This], B)

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

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

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

val self: Any

val self: Any

def stringPrefix: String

def toString(): String

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

def /:\[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

def x: GraphTraversalImpl.Impl[A, This]

def x: GraphTraversalImpl.Impl[A, This]