Path

abstract def endNode: NodeT

abstract def isValid: Boolean

Returns whether the contents of this path are valid with respect to path semantics.

abstract def iterator: Iterator[GraphParamOut[N, E]]

abstract def startNode: NodeT

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++[B >: GraphParamOut[N, E], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[GraphParamOut[N, E]], B, That]): That

def ++:[B >: GraphParamOut[N, E], That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[GraphParamOut[N, E]], B, That]): That

def ++:[B >: GraphParamOut[N, E], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[GraphParamOut[N, E]], B, That]): That

def /:[B](z: B)(op: (B, GraphParamOut[N, E]) ⇒ B): B

def :\[B](z: B)(op: (GraphParamOut[N, E], B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

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, GraphParamOut[N, E]) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[GraphParamOut[N, E], B])(implicit bf: CanBuildFrom[Iterable[GraphParamOut[N, E]], B, That]): That

def collectFirst[B](pf: PartialFunction[GraphParamOut[N, E], B]): Option[B]

def companion: GenericCompanion[Iterable]

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

def copyToArray[B >: GraphParamOut[N, E]](xs: Array[B]): Unit

def copyToArray[B >: GraphParamOut[N, E]](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: GraphParamOut[N, E]](dest: Buffer[B]): Unit

def count(p: (GraphParamOut[N, E]) ⇒ Boolean): Int

def drop(n: Int): Iterable[GraphParamOut[N, E]]

def dropRight(n: Int): Iterable[GraphParamOut[N, E]]

def dropWhile(p: (GraphParamOut[N, E]) ⇒ Boolean): Iterable[GraphParamOut[N, E]]

def edgeIterator: Iterator[GraphTraversal.EdgeT]

Iterator over the edges of this path.

def edges: List[GraphTraversal.EdgeT]

List containing all edges of this path in proper order.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (GraphParamOut[N, E]) ⇒ Boolean): Boolean

def filter(p: (GraphParamOut[N, E]) ⇒ Boolean): Iterable[GraphParamOut[N, E]]

def filterNot(p: (GraphParamOut[N, E]) ⇒ Boolean): Iterable[GraphParamOut[N, E]]

def finalize(): Unit

def find(p: (GraphParamOut[N, E]) ⇒ Boolean): Option[GraphParamOut[N, E]]

def flatMap[B, That](f: (GraphParamOut[N, E]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[GraphParamOut[N, E]], B, That]): That

def flatten[B](implicit asTraversable: (GraphParamOut[N, E]) ⇒ GenTraversableOnce[B]): Iterable[B]

def fold[A1 >: GraphParamOut[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, GraphParamOut[N, E]) ⇒ B): B

def foldRight[B](z: B)(op: (GraphParamOut[N, E], B) ⇒ B): B

def forall(p: (GraphParamOut[N, E]) ⇒ Boolean): Boolean

def foreach[U](f: (GraphParamOut[N, E]) ⇒ U): Unit

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

final def getClass(): Class[_]

def groupBy[K](f: (GraphParamOut[N, E]) ⇒ K): Map[K, Iterable[GraphParamOut[N, E]]]

def grouped(size: Int): Iterator[Iterable[GraphParamOut[N, E]]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: GraphParamOut[N, E]

def headOption: Option[GraphParamOut[N, E]]

def init: Iterable[GraphParamOut[N, E]]

def inits: Iterator[Iterable[GraphParamOut[N, E]]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def last: GraphParamOut[N, E]

def lastOption: Option[GraphParamOut[N, E]]

def length: Int

The number of edges on this path.

def map[B, That](f: (GraphParamOut[N, E]) ⇒ B)(implicit bf: CanBuildFrom[Iterable[GraphParamOut[N, E]], B, That]): That

def max[B >: GraphParamOut[N, E]](implicit cmp: Ordering[B]): GraphParamOut[N, E]

def maxBy[B](f: (GraphParamOut[N, E]) ⇒ B)(implicit cmp: Ordering[B]): GraphParamOut[N, E]

def min[B >: GraphParamOut[N, E]](implicit cmp: Ordering[B]): GraphParamOut[N, E]

def minBy[B](f: (GraphParamOut[N, E]) ⇒ B)(implicit cmp: Ordering[B]): GraphParamOut[N, E]

def mkString: String

def mkString(sep: String): String

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

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[GraphParamOut[N, E], Iterable[GraphParamOut[N, E]]]

def nodeIterator: Iterator[NodeT]

Iterator over the nodes of this path.

def nodes: List[NodeT]

List containing all nodes of this path in proper order.

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[GraphParamOut[N, E]]

def parCombiner: Combiner[GraphParamOut[N, E], ParIterable[GraphParamOut[N, E]]]

def partition(p: (GraphParamOut[N, E]) ⇒ Boolean): (Iterable[GraphParamOut[N, E]], Iterable[GraphParamOut[N, E]])

def product[B >: GraphParamOut[N, E]](implicit num: Numeric[B]): B

def reduce[A1 >: GraphParamOut[N, E]](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: GraphParamOut[N, E]](op: (B, GraphParamOut[N, E]) ⇒ B): B

def reduceLeftOption[B >: GraphParamOut[N, E]](op: (B, GraphParamOut[N, E]) ⇒ B): Option[B]

def reduceOption[A1 >: GraphParamOut[N, E]](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: GraphParamOut[N, E]](op: (GraphParamOut[N, E], B) ⇒ B): B

def reduceRightOption[B >: GraphParamOut[N, E]](op: (GraphParamOut[N, E], B) ⇒ B): Option[B]

def repr: Iterable[GraphParamOut[N, E]]

def reversed: List[GraphParamOut[N, E]]

def sameElements[B >: GraphParamOut[N, E]](that: GenIterable[B]): Boolean

def scan[B >: GraphParamOut[N, E], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[GraphParamOut[N, E]], B, That]): That

def scanLeft[B, That](z: B)(op: (B, GraphParamOut[N, E]) ⇒ B)(implicit bf: CanBuildFrom[Iterable[GraphParamOut[N, E]], B, That]): That

def scanRight[B, That](z: B)(op: (GraphParamOut[N, E], B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[GraphParamOut[N, E]], B, That]): That

def seq: Iterable[GraphParamOut[N, E]]

def size: Int

def slice(from: Int, until: Int): Iterable[GraphParamOut[N, E]]

def sliding(size: Int, step: Int): Iterator[Iterable[GraphParamOut[N, E]]]

def sliding(size: Int): Iterator[Iterable[GraphParamOut[N, E]]]

def span(p: (GraphParamOut[N, E]) ⇒ Boolean): (Iterable[GraphParamOut[N, E]], Iterable[GraphParamOut[N, E]])

def splitAt(n: Int): (Iterable[GraphParamOut[N, E]], Iterable[GraphParamOut[N, E]])

def stringPrefix: String

def sum[B >: GraphParamOut[N, E]](implicit num: Numeric[B]): B

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

def tail: Iterable[GraphParamOut[N, E]]

def tails: Iterator[Iterable[GraphParamOut[N, E]]]

def take(n: Int): Iterable[GraphParamOut[N, E]]

def takeRight(n: Int): Iterable[GraphParamOut[N, E]]

def takeWhile(p: (GraphParamOut[N, E]) ⇒ Boolean): Iterable[GraphParamOut[N, E]]

def thisCollection: Iterable[GraphParamOut[N, E]]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, GraphParamOut[N, E], Col[GraphParamOut[N, E]]]): Col[GraphParamOut[N, E]]

def toArray[B >: GraphParamOut[N, E]](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: GraphParamOut[N, E]]: Buffer[B]

def toCollection(repr: Iterable[GraphParamOut[N, E]]): Iterable[GraphParamOut[N, E]]

def toIndexedSeq: IndexedSeq[GraphParamOut[N, E]]

def toIterable: Iterable[GraphParamOut[N, E]]

def toIterator: Iterator[GraphParamOut[N, E]]

def toList: List[GraphParamOut[N, E]]

def toMap[T, U](implicit ev: <:<[GraphParamOut[N, E], (T, U)]): Map[T, U]

def toSeq: Seq[GraphParamOut[N, E]]

def toSet[B >: GraphParamOut[N, E]]: Set[B]

def toStream: Stream[GraphParamOut[N, E]]

def toString(): String

def toTraversable: Traversable[GraphParamOut[N, E]]

def toVector: Vector[GraphParamOut[N, E]]

def transpose[B](implicit asTraversable: (GraphParamOut[N, E]) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def unzip[A1, A2](implicit asPair: (GraphParamOut[N, E]) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (GraphParamOut[N, E]) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def view(from: Int, until: Int): IterableView[GraphParamOut[N, E], Iterable[GraphParamOut[N, E]]]

def view: IterableView[GraphParamOut[N, E], Iterable[GraphParamOut[N, E]]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def weight: Long

The cumulated weight of all edges on this path.

def withFilter(p: (GraphParamOut[N, E]) ⇒ Boolean): FilterMonadic[GraphParamOut[N, E], Iterable[GraphParamOut[N, E]]]

def zip[A1 >: GraphParamOut[N, E], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[GraphParamOut[N, E]], (A1, B), That]): That

def zipAll[B, A1 >: GraphParamOut[N, E], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[GraphParamOut[N, E]], (A1, B), That]): That

def zipWithIndex[A1 >: GraphParamOut[N, E], That](implicit bf: CanBuildFrom[Iterable[GraphParamOut[N, E]], (A1, Int), That]): That

def /:\[A1 >: GraphParamOut[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1