Packages

c

scalax.collection.GraphTraversalImpl

MinWeightEdgeLazyPath

class MinWeightEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath

LazyPath with edges selected by minimal weight.

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
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MinWeightEdgeLazyPath
  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 MinWeightEdgeLazyPath(nodes: Traversable[(GraphTraversalImpl.this)#NodeT], edgeFilter: (GraphTraversalImpl.this)#EdgeFilter, weightOrdering: Ordering[(GraphTraversalImpl.this)#EdgeT])

Type Members

  1. trait NodeValidator extends (NodeT) ⇒ Boolean
    Attributes
    protected
    Definition Classes
    Walk
  2. type Self = Traversable[(GraphTraversalImpl.this)#InnerElem]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to any2stringadd[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ++[B >: (GraphTraversalImpl.this)#InnerElem, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: (GraphTraversalImpl.this)#InnerElem, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: (GraphTraversalImpl.this)#InnerElem, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike
  7. def ->[B](y: B): ((GraphTraversalImpl.this)#MinWeightEdgeLazyPath, B)
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to ArrowAssoc[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. def /:[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. def :\[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  12. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  14. def aggregate[B](z: ⇒ B)(seqop: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  15. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  16. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  17. def collect[B, That](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  18. def collectFirst[B](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B]): Option[B]
    Definition Classes
    TraversableOnce
  19. def companion: GenericCompanion[Traversable]
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate
  20. final def containingGraph: GraphTraversalImpl.this

    The Graph instance that contains this walk.

    The Graph instance that contains this walk.

    Definition Classes
    Walk
  21. def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  22. def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  23. def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  24. def copyToBuffer[B >: (GraphTraversalImpl.this)#InnerElem](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  25. def count(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  26. def drop(n: Int): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  27. def dropWhile(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  28. 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
    SimpleLazyPath → Walk
  29. def endNode: (GraphTraversalImpl.this)#NodeT
    Definition Classes
    LazyPath → Walk
  30. def ensuring(cond: ((GraphTraversalImpl.this)#MinWeightEdgeLazyPath) ⇒ Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#MinWeightEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to Ensuring[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  31. def ensuring(cond: ((GraphTraversalImpl.this)#MinWeightEdgeLazyPath) ⇒ Boolean): (GraphTraversalImpl.this)#MinWeightEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to Ensuring[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  32. def ensuring(cond: Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#MinWeightEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to Ensuring[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  33. def ensuring(cond: Boolean): (GraphTraversalImpl.this)#MinWeightEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to Ensuring[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  34. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  35. def equals(other: Any): Boolean
    Definition Classes
    LazyPath → AnyRef → Any
  36. def exists(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  37. def filter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  38. def filterNot(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  39. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  40. def find(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  41. 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
  42. def flatten[B](implicit asTraversable: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B]): Traversable[B]
    Definition Classes
    GenericTraversableTemplate
  43. def fold[A1 >: (GraphTraversalImpl.this)#InnerElem](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def foldLeft[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  45. def foldRight[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  46. def forall(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  47. def foreach[U](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ U): Unit
    Definition Classes
    Walk → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  48. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to StringFormat[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  49. def genericBuilder[B]: Builder[B, Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
  50. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  51. def groupBy[K](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ K): Map[K, Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike → GenTraversableLike
  52. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  53. def hashCode(): Int
    Definition Classes
    LazyPath → AnyRef → Any
  54. def head: (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableLike → GenTraversableLike
  55. def headOption: Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  56. def init: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  57. def inits: Iterator[Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike
  58. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  59. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  60. def isEmpty: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  61. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  62. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  63. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  64. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  65. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  66. 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
    Path → Walk
  67. def last: (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableLike → GenTraversableLike
  68. def lastOption: Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  69. def length: Int

    The number of edges on this path/walk.

    The number of edges on this path/walk.

    Definition Classes
    Walk
  70. def map[B, That](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  71. def max[B >: (GraphTraversalImpl.this)#InnerElem](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  72. def maxBy[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  73. def min[B >: (GraphTraversalImpl.this)#InnerElem](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. def minBy[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  75. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  76. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  77. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  78. val n1: (GraphTraversalImpl.this)#MinWeightEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to EdgeAssoc[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  79. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  80. def newBuilder: Builder[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  81. def nodeValidator: NodeValidator
    Attributes
    protected
    Definition Classes
    Path → Walk
  82. 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
    MinWeightEdgeLazyPath → SimpleLazyPath → LazyPath → Walk
  83. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  85. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  86. def par: ParIterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    Parallelizable
  87. def parCombiner: Combiner[(GraphTraversalImpl.this)#InnerElem, ParIterable[(GraphTraversalImpl.this)#InnerElem]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  88. def partition(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): (Traversable[(GraphTraversalImpl.this)#InnerElem], Traversable[(GraphTraversalImpl.this)#InnerElem])
    Definition Classes
    TraversableLike → GenTraversableLike
  89. def product[B >: (GraphTraversalImpl.this)#InnerElem](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def reduce[A1 >: (GraphTraversalImpl.this)#InnerElem](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def reduceLeft[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B
    Definition Classes
    TraversableOnce
  92. def reduceLeftOption[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def reduceOption[A1 >: (GraphTraversalImpl.this)#InnerElem](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def reduceRight[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def reduceRightOption[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def repr: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  97. def reversed: List[(GraphTraversalImpl.this)#InnerElem]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  98. 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
  99. 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
  100. 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.

  101. final def selectEdge(from: (GraphTraversalImpl.this)#NodeT, to: (GraphTraversalImpl.this)#NodeT): (GraphTraversalImpl.this)#EdgeT
    Definition Classes
    MinWeightEdgeLazyPath → SimpleLazyPath
  102. def seq: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  103. 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
  104. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  105. def slice(from: Int, until: Int): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  106. def span(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): (Traversable[(GraphTraversalImpl.this)#InnerElem], Traversable[(GraphTraversalImpl.this)#InnerElem])
    Definition Classes
    TraversableLike → GenTraversableLike
  107. def splitAt(n: Int): (Traversable[(GraphTraversalImpl.this)#InnerElem], Traversable[(GraphTraversalImpl.this)#InnerElem])
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def startNode: (GraphTraversalImpl.this)#NodeT
    Definition Classes
    LazyPath → Walk
  109. def stringPrefix: String
    Definition Classes
    Path → Walk → TraversableLike → GenTraversableLike
  110. def sum[B >: (GraphTraversalImpl.this)#InnerElem](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  112. def tail: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  113. def tails: Iterator[Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike
  114. def take(n: Int): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  115. def takeWhile(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  116. def thisCollection: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  117. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (GraphTraversalImpl.this)#InnerElem, Col[(GraphTraversalImpl.this)#InnerElem]]): Col[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  118. def toArray[B >: (GraphTraversalImpl.this)#InnerElem](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def toBuffer[B >: (GraphTraversalImpl.this)#InnerElem]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. def toCollection(repr: Traversable[(GraphTraversalImpl.this)#InnerElem]): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  121. def toIndexedSeq: IndexedSeq[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  122. def toIterable: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. def toIterator: Iterator[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableOnce
  124. def toList: List[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  125. def toMap[T, U](implicit ev: <:<[(GraphTraversalImpl.this)#InnerElem, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  126. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to CollectionsHaveToParArray[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type ((GraphTraversalImpl.this)#MinWeightEdgeLazyPath) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  127. def toSeq: Seq[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  128. def toSet[B >: (GraphTraversalImpl.this)#InnerElem]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  129. def toStream: Stream[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableOnce
  130. def toString(): String
    Definition Classes
    TraversableLike → Any
  131. def toTraversable: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  132. def toVector: Vector[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. 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.

  134. def unzip[A1, A2](implicit asPair: ((GraphTraversalImpl.this)#InnerElem) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
    Definition Classes
    GenericTraversableTemplate
  135. def unzip3[A1, A2, A3](implicit asTriple: ((GraphTraversalImpl.this)#InnerElem) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
    Definition Classes
    GenericTraversableTemplate
  136. val value: (GraphTraversalImpl.this)#MinWeightEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  137. def view(from: Int, until: Int): TraversableView[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike
  138. def view: TraversableView[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike
  139. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  140. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  141. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  142. 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
  143. 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
  144. def withFilter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): FilterMonadic[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike → FilterMonadic
  145. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to EdgeAssoc[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  146. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to EdgeAssoc[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  147. def →[B](y: B): ((GraphTraversalImpl.this)#MinWeightEdgeLazyPath, B)
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to ArrowAssoc[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

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)#MinWeightEdgeLazyPath 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:
    (minWeightEdgeLazyPath: 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)#MinWeightEdgeLazyPath 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:
    (minWeightEdgeLazyPath: 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)#MinWeightEdgeLazyPath 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:
    (minWeightEdgeLazyPath: 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)#MinWeightEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] 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:
    (minWeightEdgeLazyPath: OuterNode[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath]).stringPrefix
    Definition Classes
    NodeParam
  5. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath] 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:
    (minWeightEdgeLazyPath: OuterNode[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath]).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)#MinWeightEdgeLazyPath 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:
    (minWeightEdgeLazyPath: MonadOps[(GraphTraversalImpl.this)#InnerElem]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from (GraphTraversalImpl.this)#SimpleLazyPath

Inherited from (GraphTraversalImpl.this)#LazyPath

Inherited from (GraphTraversalImpl.this)#Path

Inherited from (GraphTraversalImpl.this)#Walk

Inherited from Traversable[(GraphTraversalImpl.this)#InnerElem]

Inherited from GenTraversable[(GraphTraversalImpl.this)#InnerElem]

Inherited from GenericTraversableTemplate[(GraphTraversalImpl.this)#InnerElem, Traversable]

Inherited from TraversableLike[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]

Inherited from GenTraversableLike[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]

Inherited from Parallelizable[(GraphTraversalImpl.this)#InnerElem, ParIterable[(GraphTraversalImpl.this)#InnerElem]]

Inherited from TraversableOnce[(GraphTraversalImpl.this)#InnerElem]

Inherited from GenTraversableOnce[(GraphTraversalImpl.this)#InnerElem]

Inherited from FilterMonadic[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]

Inherited from HasNewBuilder[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath]

Inherited by implicit conversion CollectionsHaveToParArray from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to CollectionsHaveToParArray[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath, T]

Inherited by implicit conversion MonadOps from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to MonadOps[(GraphTraversalImpl.this)#InnerElem]

Inherited by implicit conversion EdgeAssoc from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to EdgeAssoc[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath]

Inherited by implicit conversion any2stringadd from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to any2stringadd[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath]

Inherited by implicit conversion StringFormat from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to StringFormat[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath]

Inherited by implicit conversion Ensuring from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to Ensuring[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath]

Inherited by implicit conversion ArrowAssoc from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to ArrowAssoc[(GraphTraversalImpl.this)#MinWeightEdgeLazyPath]

Inherited by implicit conversion alternateImplicit from (GraphTraversalImpl.this)#MinWeightEdgeLazyPath to ForceImplicitAmbiguity

Ungrouped