PathBuilder

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ++=(xs: TraversableOnce[(GraphTraversalImpl.this)#InnerElem]): PathBuilder.this.type

final def +=(edge: (GraphTraversalImpl.this)#EdgeT): PathBuilder.this.type

Tries to add edge to the tail of the path/walk.

final def +=(node: (GraphTraversalImpl.this)#NodeT): PathBuilder.this.type

Tries to add node to the tail of the path/walk.

def +=(elem: (GraphTraversalImpl.this)#InnerElem): PathBuilder.this.type

Tries to add elem to the tail of the path/walk.

def +=(elem1: (GraphTraversalImpl.this)#InnerElem, elem2: (GraphTraversalImpl.this)#InnerElem, elems: (GraphTraversalImpl.this)#InnerElem*): PathBuilder.this.type

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def add(edge: (GraphTraversalImpl.this)#EdgeT): Boolean

Tries to add edge to the tail of the path/walk.

def add(node: (GraphTraversalImpl.this)#NodeT): Boolean

Tries to add node to the tail of the path/walk.

final def add(elem: (GraphTraversalImpl.this)#InnerElem): Boolean

Tries to add elem to the tail of the path/walk.

final def asInstanceOf[T0]: T0

def clear(): Unit

def clone(): AnyRef

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

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

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

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

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

final def getClass(): Class[_]

def hashCode(): Int

def isDefined: Boolean

def isEdge: Boolean

def isIn: Boolean

final def isInstanceOf[T0]: Boolean

def isNode: Boolean

def isOut: Boolean

var lastNode: Option[(GraphTraversalImpl.this)#NodeT]

def mapResult[NewTo](f: ((GraphTraversalImpl.this)#Path) ⇒ NewTo): Builder[(GraphTraversalImpl.this)#InnerElem, NewTo]

val n1: (GraphTraversalImpl.this)#PathBuilder

final def ne(arg0: AnyRef): Boolean

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

final def notify(): Unit

final def notifyAll(): Unit

def result(): (GraphTraversalImpl.this)#Path

final def resultEdges: IndexedSeq[(GraphTraversalImpl.this)#EdgeT]

def select(fromNodes: Set[(GraphTraversalImpl.this)#NodeT]): Option[(GraphTraversalImpl.this)#NodeT]

def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

def sizeHint(coll: TraversableLike[_, _]): Unit

def sizeHint(size: Int): Unit

def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

val start: (GraphTraversalImpl.this)#NodeT

The node this walk starts at.

def stringPrefix: String

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

def toString(): String

val value: (GraphTraversalImpl.this)#PathBuilder

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

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

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

val self: Any

val self: Any

def toString(): String

def x: (GraphTraversalImpl.this)#PathBuilder

def x: (GraphTraversalImpl.this)#PathBuilder