Packages

class AnyEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath

LazyPath where edges are selected by taking the first one fitting.

Attributes
protected
Linear Supertypes
(GraphTraversalImpl.this)#SimpleLazyPath, (GraphTraversalImpl.this)#LazyPath, (GraphTraversalImpl.this)#Path, (GraphTraversalImpl.this)#Walk, Traversable[(GraphTraversalImpl.this)#InnerElem], GenTraversable[(GraphTraversalImpl.this)#InnerElem], GenericTraversableTemplate[(GraphTraversalImpl.this)#InnerElem, Traversable], TraversableLike[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]], GenTraversableLike[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]], Parallelizable[(GraphTraversalImpl.this)#InnerElem, ParIterable[(GraphTraversalImpl.this)#InnerElem]], TraversableOnce[(GraphTraversalImpl.this)#InnerElem], GenTraversableOnce[(GraphTraversalImpl.this)#InnerElem], FilterMonadic[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]], HasNewBuilder[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AnyEdgeLazyPath
  2. SimpleLazyPath
  3. LazyPath
  4. Path
  5. Walk
  6. Traversable
  7. GenTraversable
  8. GenericTraversableTemplate
  9. TraversableLike
  10. GenTraversableLike
  11. Parallelizable
  12. TraversableOnce
  13. GenTraversableOnce
  14. FilterMonadic
  15. HasNewBuilder
  16. AnyRef
  17. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by EdgeAssoc
  5. by any2stringadd
  6. by StringFormat
  7. by Ensuring
  8. by ArrowAssoc
  9. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new AnyEdgeLazyPath(nodes: Traversable[(GraphTraversalImpl.this)#NodeT], edgeFilter: (GraphTraversalImpl.this)#EdgeFilter)

Type Members

  1. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. def ++[B >: (GraphTraversalImpl.this)#InnerElem, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  2. def ++:[B >: (GraphTraversalImpl.this)#InnerElem, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike
  3. def ++:[B >: (GraphTraversalImpl.this)#InnerElem, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike
  4. def /:[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  5. def :\[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  6. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  7. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  8. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  9. def aggregate[B](z: ⇒ B)(seqop: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. def collect[B, That](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  11. def collectFirst[B](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B]): Option[B]
    Definition Classes
    TraversableOnce
  12. def companion: GenericCompanion[Traversable]
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate
  13. final def containingGraph: GraphTraversalImpl.this

    The Graph instance that contains this walk.

    The Graph instance that contains this walk.

    Definition Classes
    Walk
  14. def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  15. def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  16. def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  17. def copyToBuffer[B >: (GraphTraversalImpl.this)#InnerElem](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  18. def count(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  19. def drop(n: Int): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  20. def dropWhile(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  21. final lazy val edges: ArrayBuffer[(GraphTraversalImpl.this)#EdgeT]

    All edges of this path/walk in proper order.

    All edges of this path/walk in proper order.

    Definition Classes
    SimpleLazyPathWalk
  22. def endNode: (GraphTraversalImpl.this)#NodeT
    Definition Classes
    LazyPathWalk
  23. def equals(other: Any): Boolean
    Definition Classes
    LazyPath → AnyRef → Any
  24. def exists(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  25. def filter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  26. def filterNot(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  27. def find(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  28. def flatMap[B, That](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  29. def flatten[B](implicit asTraversable: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B]): Traversable[B]
    Definition Classes
    GenericTraversableTemplate
  30. def fold[A1 >: (GraphTraversalImpl.this)#InnerElem](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  31. def foldLeft[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def foldRight[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def forall(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  34. def foreach[U](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ U): Unit
    Definition Classes
    Walk → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  35. def genericBuilder[B]: Builder[B, Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
  36. def groupBy[K](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ K): Map[K, Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike → GenTraversableLike
  37. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  38. def hashCode(): Int
    Definition Classes
    LazyPath → AnyRef → Any
  39. def head: (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableLike → GenTraversableLike
  40. def headOption: Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  41. def init: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  42. def inits: Iterator[Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike
  43. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#AnyEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  44. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#AnyEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  45. def isEmpty: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  46. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#AnyEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  47. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#AnyEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  48. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#AnyEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  49. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  50. def isValid: Boolean

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

    Returns whether the nodes and edges on this path are valid with respect to this graph. This optional check is sane if there is reasonable doubt about the correctness of some algorithm results.

    Definition Classes
    PathWalk
  51. def last: (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableLike → GenTraversableLike
  52. def lastOption: Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  53. def length: Int

    The number of edges on this path/walk.

    The number of edges on this path/walk.

    Definition Classes
    Walk
  54. def map[B, That](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  55. def max[B >: (GraphTraversalImpl.this)#InnerElem](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  56. def maxBy[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  57. def min[B >: (GraphTraversalImpl.this)#InnerElem](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  58. def minBy[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  59. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  60. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  61. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  62. val n1: (GraphTraversalImpl.this)#AnyEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to EdgeAssoc[(GraphTraversalImpl.this)#AnyEdgeLazyPath] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  63. val nodes: Traversable[(GraphTraversalImpl.this)#NodeT]

    All nodes on this path/walk in proper order.

    All nodes on this path/walk in proper order.

    Definition Classes
    AnyEdgeLazyPathSimpleLazyPathLazyPathWalk
  64. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  65. def par: ParIterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    Parallelizable
  66. def partition(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): (Traversable[(GraphTraversalImpl.this)#InnerElem], Traversable[(GraphTraversalImpl.this)#InnerElem])
    Definition Classes
    TraversableLike → GenTraversableLike
  67. def product[B >: (GraphTraversalImpl.this)#InnerElem](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. def reduce[A1 >: (GraphTraversalImpl.this)#InnerElem](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  69. def reduceLeft[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B
    Definition Classes
    TraversableOnce
  70. def reduceLeftOption[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  71. def reduceOption[A1 >: (GraphTraversalImpl.this)#InnerElem](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  72. def reduceRight[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  73. def reduceRightOption[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. def repr: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  75. def scan[B >: (GraphTraversalImpl.this)#InnerElem, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  76. def scanLeft[B, That](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  77. def scanRight[B, That](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  78. def seq: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  79. def size: Int

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

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

    Definition Classes
    Walk → GenTraversableLike → TraversableOnce → GenTraversableOnce
  80. def slice(from: Int, until: Int): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  81. def span(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): (Traversable[(GraphTraversalImpl.this)#InnerElem], Traversable[(GraphTraversalImpl.this)#InnerElem])
    Definition Classes
    TraversableLike → GenTraversableLike
  82. def splitAt(n: Int): (Traversable[(GraphTraversalImpl.this)#InnerElem], Traversable[(GraphTraversalImpl.this)#InnerElem])
    Definition Classes
    TraversableLike → GenTraversableLike
  83. def startNode: (GraphTraversalImpl.this)#NodeT
    Definition Classes
    LazyPathWalk
  84. def stringPrefix: String
    Definition Classes
    PathWalk → TraversableLike → GenTraversableLike
  85. def sum[B >: (GraphTraversalImpl.this)#InnerElem](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def tail: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  87. def tails: Iterator[Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike
  88. def take(n: Int): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  89. def takeWhile(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  90. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (GraphTraversalImpl.this)#InnerElem, Col[(GraphTraversalImpl.this)#InnerElem]]): Col[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  91. def toArray[B >: (GraphTraversalImpl.this)#InnerElem](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def toBuffer[B >: (GraphTraversalImpl.this)#InnerElem]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def toIndexedSeq: IndexedSeq[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def toIterable: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def toIterator: Iterator[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableOnce
  96. def toList: List[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def toMap[T, U](implicit ev: <:<[(GraphTraversalImpl.this)#InnerElem, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to CollectionsHaveToParArray[(GraphTraversalImpl.this)#AnyEdgeLazyPath, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type ((GraphTraversalImpl.this)#AnyEdgeLazyPath) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  99. def toSeq: Seq[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def toSet[B >: (GraphTraversalImpl.this)#InnerElem]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def toStream: Stream[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableOnce
  102. def toString(): String
    Definition Classes
    TraversableLike → Any
  103. def toTraversable: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  104. def toVector: Vector[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def transpose[B](implicit asTraversable: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  106. def unzip[A1, A2](implicit asPair: ((GraphTraversalImpl.this)#InnerElem) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
    Definition Classes
    GenericTraversableTemplate
  107. def unzip3[A1, A2, A3](implicit asTriple: ((GraphTraversalImpl.this)#InnerElem) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
    Definition Classes
    GenericTraversableTemplate
  108. val value: (GraphTraversalImpl.this)#AnyEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#AnyEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  109. def view(from: Int, until: Int): TraversableView[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike
  110. def view: TraversableView[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike
  111. final def weight[T](f: ((GraphTraversalImpl.this)#EdgeT) ⇒ T)(implicit arg0: Numeric[T]): T

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

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

    f

    The weight function overriding edge weights.

    Definition Classes
    Walk
  112. final def weight: Double

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

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

    Definition Classes
    Walk
  113. def withFilter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): FilterMonadic[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike → FilterMonadic
  114. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to EdgeAssoc[(GraphTraversalImpl.this)#AnyEdgeLazyPath] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  115. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to EdgeAssoc[(GraphTraversalImpl.this)#AnyEdgeLazyPath] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

Shadowed Implicit Value Members

  1. def filter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): TraversableOnce[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to MonadOps[(GraphTraversalImpl.this)#InnerElem] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (anyEdgeLazyPath: MonadOps[(GraphTraversalImpl.this)#InnerElem]).filter(p)
    Definition Classes
    MonadOps
  2. def flatMap[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to MonadOps[(GraphTraversalImpl.this)#InnerElem] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (anyEdgeLazyPath: MonadOps[(GraphTraversalImpl.this)#InnerElem]).flatMap(f)
    Definition Classes
    MonadOps
  3. def map[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to MonadOps[(GraphTraversalImpl.this)#InnerElem] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (anyEdgeLazyPath: MonadOps[(GraphTraversalImpl.this)#InnerElem]).map(f)
    Definition Classes
    MonadOps
  4. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#AnyEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (anyEdgeLazyPath: OuterNode[(GraphTraversalImpl.this)#AnyEdgeLazyPath]).stringPrefix
    Definition Classes
    NodeParam
  5. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#AnyEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (anyEdgeLazyPath: OuterNode[(GraphTraversalImpl.this)#AnyEdgeLazyPath]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  6. def withFilter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Iterator[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#AnyEdgeLazyPath to MonadOps[(GraphTraversalImpl.this)#InnerElem] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (anyEdgeLazyPath: MonadOps[(GraphTraversalImpl.this)#InnerElem]).withFilter(p)
    Definition Classes
    MonadOps