AnyEdgeLazyCycle

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ++[B >: (GraphTraversalImpl.this)#InnerElem, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That

def ++:[B >: (GraphTraversalImpl.this)#InnerElem, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That

def ++:[B >: (GraphTraversalImpl.this)#InnerElem, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That

def ->[B](y: B): ((GraphTraversalImpl.this)#AnyEdgeLazyCycle, B)

def /:[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B

def :\[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, 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, (GraphTraversalImpl.this)#InnerElem) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That

def collectFirst[B](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B]): Option[B]

def companion: GenericCompanion[Traversable]

def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B]): Unit

def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: (GraphTraversalImpl.this)#InnerElem](dest: Buffer[B]): Unit

def count(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Int

def drop(n: Int): Traversable[(GraphTraversalImpl.this)#InnerElem]

def dropWhile(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]

final lazy val edges: ArrayBuffer[(GraphTraversalImpl.this)#EdgeT]

All edges of this path/walk in proper order.

def endNode: (GraphTraversalImpl.this)#NodeT

def ensuring(cond: ((GraphTraversalImpl.this)#AnyEdgeLazyCycle) ⇒ Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#AnyEdgeLazyCycle

def ensuring(cond: ((GraphTraversalImpl.this)#AnyEdgeLazyCycle) ⇒ Boolean): (GraphTraversalImpl.this)#AnyEdgeLazyCycle

def ensuring(cond: Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#AnyEdgeLazyCycle

def ensuring(cond: Boolean): (GraphTraversalImpl.this)#AnyEdgeLazyCycle

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

def exists(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Boolean

def filter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]

def filterNot(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]

def finalize(): Unit

def find(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Option[(GraphTraversalImpl.this)#InnerElem]

def flatMap[B, That](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That

def flatten[B](implicit asTraversable: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B]): Traversable[B]

def fold[A1 >: (GraphTraversalImpl.this)#InnerElem](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B

def foldRight[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B

def forall(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Boolean

def foreach[U](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ U): Unit

def formatted(fmtstr: String): String

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

final def getClass(): Class[_]

def groupBy[K](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ K): Map[K, Traversable[(GraphTraversalImpl.this)#InnerElem]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: (GraphTraversalImpl.this)#InnerElem

def headOption: Option[(GraphTraversalImpl.this)#InnerElem]

def init: Traversable[(GraphTraversalImpl.this)#InnerElem]

def inits: Iterator[Traversable[(GraphTraversalImpl.this)#InnerElem]]

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 isValid: Boolean

Returns whether the nodes and edges on this path are valid with respect to this graph.

def last: (GraphTraversalImpl.this)#InnerElem

def lastOption: Option[(GraphTraversalImpl.this)#InnerElem]

def length: Int

The number of edges on this path/walk.

def map[B, That](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That

def max[B >: (GraphTraversalImpl.this)#InnerElem](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem

def maxBy[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem

def min[B >: (GraphTraversalImpl.this)#InnerElem](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem

def minBy[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem

def mkString: String

def mkString(sep: String): String

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

val n1: (GraphTraversalImpl.this)#AnyEdgeLazyCycle

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]

def nodeValidator: NodeValidator

val nodes: Traversable[(GraphTraversalImpl.this)#NodeT]

All nodes on this path/walk in proper order.

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[(GraphTraversalImpl.this)#InnerElem]

def parCombiner: Combiner[(GraphTraversalImpl.this)#InnerElem, ParIterable[(GraphTraversalImpl.this)#InnerElem]]

def partition(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): (Traversable[(GraphTraversalImpl.this)#InnerElem], Traversable[(GraphTraversalImpl.this)#InnerElem])

def product[B >: (GraphTraversalImpl.this)#InnerElem](implicit num: Numeric[B]): B

def reduce[A1 >: (GraphTraversalImpl.this)#InnerElem](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B

def reduceLeftOption[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): Option[B]

def reduceOption[A1 >: (GraphTraversalImpl.this)#InnerElem](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B

def reduceRightOption[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): Option[B]

def repr: Traversable[(GraphTraversalImpl.this)#InnerElem]

def reversed: List[(GraphTraversalImpl.this)#InnerElem]

final def sameAs(that: Cycle): Boolean

Semantically compares this cycle with that cycle.

final def sameElements(that: Traversable[_]): Boolean

Same as sameAs but also comparing this cycle with any Traversable.

def scan[B >: (GraphTraversalImpl.this)#InnerElem, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That

def scanLeft[B, That](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That

def scanRight[B, That](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That

final def selectEdge(from: (GraphTraversalImpl.this)#NodeT, to: (GraphTraversalImpl.this)#NodeT): (GraphTraversalImpl.this)#EdgeT

def seq: Traversable[(GraphTraversalImpl.this)#InnerElem]

def size: Int

The number of nodes and edges on this path/walk.

def slice(from: Int, until: Int): Traversable[(GraphTraversalImpl.this)#InnerElem]

def span(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): (Traversable[(GraphTraversalImpl.this)#InnerElem], Traversable[(GraphTraversalImpl.this)#InnerElem])

def splitAt(n: Int): (Traversable[(GraphTraversalImpl.this)#InnerElem], Traversable[(GraphTraversalImpl.this)#InnerElem])

def startNode: (GraphTraversalImpl.this)#NodeT

def stringPrefix: String

def sum[B >: (GraphTraversalImpl.this)#InnerElem](implicit num: Numeric[B]): B

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

def tail: Traversable[(GraphTraversalImpl.this)#InnerElem]

def tails: Iterator[Traversable[(GraphTraversalImpl.this)#InnerElem]]

def take(n: Int): Traversable[(GraphTraversalImpl.this)#InnerElem]

def takeWhile(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]

def thisCollection: Traversable[(GraphTraversalImpl.this)#InnerElem]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (GraphTraversalImpl.this)#InnerElem, Col[(GraphTraversalImpl.this)#InnerElem]]): Col[(GraphTraversalImpl.this)#InnerElem]

def toArray[B >: (GraphTraversalImpl.this)#InnerElem](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: (GraphTraversalImpl.this)#InnerElem]: Buffer[B]

def toCollection(repr: Traversable[(GraphTraversalImpl.this)#InnerElem]): Traversable[(GraphTraversalImpl.this)#InnerElem]

def toIndexedSeq: IndexedSeq[(GraphTraversalImpl.this)#InnerElem]

def toIterable: Iterable[(GraphTraversalImpl.this)#InnerElem]

def toIterator: Iterator[(GraphTraversalImpl.this)#InnerElem]

def toList: List[(GraphTraversalImpl.this)#InnerElem]

def toMap[T, U](implicit ev: <:<[(GraphTraversalImpl.this)#InnerElem, (T, U)]): Map[T, U]

def toParArray: ParArray[T]

def toSeq: Seq[(GraphTraversalImpl.this)#InnerElem]

def toSet[B >: (GraphTraversalImpl.this)#InnerElem]: Set[B]

def toStream: Stream[(GraphTraversalImpl.this)#InnerElem]

def toString(): String

def toTraversable: Traversable[(GraphTraversalImpl.this)#InnerElem]

def toVector: Vector[(GraphTraversalImpl.this)#InnerElem]

def transpose[B](implicit asTraversable: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]

def unzip[A1, A2](implicit asPair: ((GraphTraversalImpl.this)#InnerElem) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

def unzip3[A1, A2, A3](implicit asTriple: ((GraphTraversalImpl.this)#InnerElem) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])

val value: (GraphTraversalImpl.this)#AnyEdgeLazyCycle

def view(from: Int, until: Int): TraversableView[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]

def view: TraversableView[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

final def weight[T](f: ((GraphTraversalImpl.this)#EdgeT) ⇒ T)(implicit arg0: Numeric[T]): T

The cumulated weight of all edges on this path/walk.

final def weight: Long

The cumulated weight of all edges on this path/walk.

def withFilter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): FilterMonadic[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]

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

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

def →[B](y: B): ((GraphTraversalImpl.this)#AnyEdgeLazyCycle, B)

def filter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): TraversableOnce[(GraphTraversalImpl.this)#InnerElem]

def flatMap[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

def map[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B): TraversableOnce[B]

def stringPrefix: String

def toString(): String

def withFilter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Iterator[(GraphTraversalImpl.this)#InnerElem]