Packages

abstract class InnerEdgeTraverser extends TraverserMethods[EdgeT, InnerEdgeTraverser] with Traverser[EdgeT, InnerEdgeTraverser]

Controls the properties of inner-edge graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.

Linear Supertypes
Traverser[GraphTraversal.EdgeT, InnerEdgeTraverser], ForeachBasedDetachingIterable[GraphTraversal.EdgeT], Iterable[GraphTraversal.EdgeT], IterableFactoryDefaults[GraphTraversal.EdgeT, Iterable], IterableOps[GraphTraversal.EdgeT, Iterable, Iterable[GraphTraversal.EdgeT]], IterableOnceOps[GraphTraversal.EdgeT, Iterable, Iterable[GraphTraversal.EdgeT]], IterableOnce[GraphTraversal.EdgeT], Properties, SubgraphProperties, TraverserMethods[GraphTraversal.EdgeT, InnerEdgeTraverser], FluentProperties[InnerEdgeTraverser], AnyRef, Any
Known Subclasses
InnerEdgeTraverserImpl
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. InnerEdgeTraverser
  2. Traverser
  3. ForeachBasedDetachingIterable
  4. Iterable
  5. IterableFactoryDefaults
  6. IterableOps
  7. IterableOnceOps
  8. IterableOnce
  9. Properties
  10. SubgraphProperties
  11. TraverserMethods
  12. FluentProperties
  13. AnyRef
  14. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new InnerEdgeTraverser()

Abstract Value Members

  1. abstract def apply[U](pred: GraphTraversal.NodePredicate = noNode, visitor: (GraphTraversal.EdgeT) => U = empty): Option[NodeT]
    Attributes
    protected
    Definition Classes
    TraverserMethods
  2. abstract def edgeVisitor[U](f: (GraphTraversal.EdgeT) => U): (GraphTraversal.EdgeT) => U
    Attributes
    protected
    Definition Classes
    TraverserMethods
  3. abstract def findCycle[U](implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[Cycle]

    Finds a cycle starting the search at root taking optional properties like subgraph restriction, ordering or maximum depth into account., if any.

    Finds a cycle starting the search at root taking optional properties like subgraph restriction, ordering or maximum depth into account., if any. The resulting cycle may start at any node connected with this node.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    A cycle or None if either

    1. there exists no cycle in the component depicting by root or
    2. there exists a cycle in the component but due to withSubgraph settings this path was out of scope.
    Definition Classes
    TraverserMethods
  4. abstract def newTraverser: (NodeT, Parameters, GraphTraversal.NodePredicate, GraphTraversal.EdgePredicate, GraphTraversal.ElemOrdering, Option[Weight]) => InnerEdgeTraverser
    Attributes
    protected
    Definition Classes
    FluentProperties
  5. abstract def nodeVisitor[U](f: (GraphTraversal.EdgeT) => U): (NodeT) => U
    Attributes
    protected
    Definition Classes
    TraverserMethods
  6. abstract def ordering: GraphTraversal.ElemOrdering

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    Definition Classes
    Properties
  7. abstract def parameters: Parameters

    The properties controlling subsequent traversals.

    The properties controlling subsequent traversals.

    Definition Classes
    Properties
  8. abstract def partOfCycle[U](implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[Cycle]

    Finds a cycle that contains root taking optional properties like subgraph restriction, ordering or maximum depth into account..

    Finds a cycle that contains root taking optional properties like subgraph restriction, ordering or maximum depth into account.. Irrespective of the current setting for kind, DepthFirst is used internally.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    A cycle containing root or None if either

    1. there exists no cycle containing root or
    2. there exists such a cycle but due to withSubgraph settings this path was out of scope.
    Definition Classes
    TraverserMethods
  9. abstract def pathUntil[U](pred: GraphTraversal.NodePredicate)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[Path]

    Finds a path from root to a successor of root for which pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds a path from root to a successor of root for which pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. root itself does not count as a match. This is also true if it has a hook. If several successors exist the algorithm selects any one of these.

    pred

    The predicate which must hold true for the successor.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    A path to a node with the predicate pred or None if either

    1. there is no node with pred or
    2. there exists no path to such a node or
    3. there exists a path to such a node but due to withSubgraph settings this path was out of scope.
    Definition Classes
    TraverserMethods
  10. abstract def root: NodeT

    The node where subsequent graph traversals start.

    The node where subsequent graph traversals start.

    Definition Classes
    Properties
  11. abstract def shortestPathTo[T, U](potentialSuccessor: NodeT, weight: (GraphTraversal.EdgeT) => T, visitor: (GraphTraversal.EdgeT) => U)(implicit arg0: Numeric[T]): Option[Path]

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. The calculation is based on the weight of the edges on the path. Edges have a default weight of 1L that can be overridden by custom edges. A weight function yielding any numeric type may also be passed to shortestPathTo.

    potentialSuccessor

    The node the shortest path is to be found to.

    weight

    Function to determine the weight of edges. If supplied, this function takes precedence over edge weights.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    The shortest path to potentialSuccessor or None if either

    1. there exists no path to potentialSuccessor or
    2. there exists a path to potentialSuccessor but due to withSubgraph settings this path was out of scope.
    Definition Classes
    TraverserMethods
  12. abstract def strongComponents[U](implicit visitor: (GraphTraversal.EdgeT) => U = empty): Iterable[Component]

    Finds all strongly connected components reachable from this node.

    Finds all strongly connected components reachable from this node. See componentTraverser for more control by means of FluentProperties.

    visitor

    Function to be called for each inner node or inner edge visited during the search.

    Definition Classes
    TraverserMethods
  13. abstract def subgraphEdges: GraphTraversal.EdgePredicate

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    Definition Classes
    SubgraphProperties
  14. abstract def subgraphNodes: GraphTraversal.NodePredicate

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    Definition Classes
    SubgraphProperties
  15. abstract def topologicalSort[U](ignorePredecessors: Boolean = false)(implicit visitor: (GraphTraversal.InnerElem) => U = empty): TopologicalSort

    Sorts the component designated by this node topologically.

    Sorts the component designated by this node topologically. Only nodes connected with this node will be included in the resulting topological order. If the graph is known to be connected choose GraphTraversal#topologicalSort instead. See componentTraverser for more control by means of FluentProperties.

    ignorePredecessors

    If true, the topological sort will be partial in that it will only include successors of root. withSubgraph restricts the successor nodes to be included but not predecessors that will be excluded in total.

    visitor

    Function to be called for each inner node or inner edge visited during the sort.

    Definition Classes
    TraverserMethods
  16. abstract def weakComponent[U](implicit visitor: (GraphTraversal.EdgeT) => U = empty): Component

    Determines the weak component that contains this node.

    Determines the weak component that contains this node. See componentTraverser for more control by means of FluentProperties.

    visitor

    Function to be called for each inner node or inner edge visited during the search.

    Definition Classes
    TraverserMethods

Concrete 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 InnerEdgeTraverser toany2stringadd[InnerEdgeTraverser] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. final def ++[B >: GraphTraversal.EdgeT](suffix: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  5. def ->[B](y: B): (InnerEdgeTraverser, B)
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toArrowAssoc[InnerEdgeTraverser] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. final def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
  8. final def addString(b: StringBuilder): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  9. final def addString(b: StringBuilder, sep: String): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  10. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  11. def autarkicForeach[U](f: (GraphTraversal.EdgeT) => U): Unit
    Attributes
    protected
    Definition Classes
    Traverser → ForeachBasedDetachingIterable
  12. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  13. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  14. final def coll: InnerEdgeTraverser.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  15. final def collect[B](pf: PartialFunction[GraphTraversal.EdgeT, B]): Iterable[B]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
  16. final def collectFirst[B](pf: PartialFunction[GraphTraversal.EdgeT, B]): Option[B]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
  17. def concat[B >: GraphTraversal.EdgeT](suffix: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
  18. def copyToArray[B >: GraphTraversal.EdgeT](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  19. def copyToArray[B >: GraphTraversal.EdgeT](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  20. def copyToArray[B >: GraphTraversal.EdgeT](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  21. def corresponds[B](that: IterableOnce[B])(p: (GraphTraversal.EdgeT, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  22. final def count(p: (GraphTraversal.EdgeT) => Boolean): Int
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
  23. final def drop(n: Int): CC[GraphTraversal.EdgeT]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
    Annotations
    @inline()
  24. def dropRight(n: Int): Iterable[GraphTraversal.EdgeT]
    Definition Classes
    IterableOps
  25. final def dropWhile(p: (GraphTraversal.EdgeT) => Boolean): CC[GraphTraversal.EdgeT]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
  26. def empty: Iterable[GraphTraversal.EdgeT]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  27. def ensuring(cond: (InnerEdgeTraverser) => Boolean, msg: => Any): InnerEdgeTraverser
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toEnsuring[InnerEdgeTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  28. def ensuring(cond: (InnerEdgeTraverser) => Boolean): InnerEdgeTraverser
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toEnsuring[InnerEdgeTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  29. def ensuring(cond: Boolean, msg: => Any): InnerEdgeTraverser
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toEnsuring[InnerEdgeTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  30. def ensuring(cond: Boolean): InnerEdgeTraverser
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toEnsuring[InnerEdgeTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  31. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  32. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  33. final def exists(p: (GraphTraversal.EdgeT) => Boolean): Boolean
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
  34. final def filter(p: (GraphTraversal.EdgeT) => Boolean): CC[GraphTraversal.EdgeT]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
    Annotations
    @inline()
  35. final def filterNot(p: (GraphTraversal.EdgeT) => Boolean): CC[GraphTraversal.EdgeT]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
    Annotations
    @inline()
  36. final def find(p: (GraphTraversal.EdgeT) => Boolean): Option[GraphTraversal.EdgeT]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
  37. final def findConnected[U](pred: GraphTraversal.NodePredicate)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[NodeT]

    Finds a node connected with root by any number of edges with any direction for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds a node connected with root by any number of edges with any direction for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. For directed or mixed graphs the node to be found is weakly connected with this node. root itself does not count as a match. This is also true if it has a hook. If several connected nodes exist with pred the algorithm selects any one of these.

    pred

    The predicate which must hold true for the resulting node.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    A node with the predicate pred or None if either

    1. there is no node with pred or
    2. there exists no connection to such a node or
    3. there exists a connection to such a node but due to withSubgraph settings this path was out of scope.
    Definition Classes
    TraverserMethods
  38. final def findPredecessor[U](pred: GraphTraversal.NodePredicate)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[NodeT]

    Finds a predecessor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds a predecessor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. root itself does not count as a match. This is also true if it has a hook. If several predecessors exist the algorithm selects the first of them found.

    pred

    The predicate which must hold true for the resulting node.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    A node with the predicate pred or None if either

    1. there is no node with pred or
    2. there exists no path from such a node to this node or
    3. there exists a path from such a node to root but due to withSubgraph settings this path was out of scope.
    Definition Classes
    TraverserMethods
  39. final def findSuccessor[U](pred: GraphTraversal.NodePredicate)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[NodeT]

    Finds a successor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds a successor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. root itself does not count as a match. This is also true if it has a hook. If several successors holding pred exist any one of them may be returned.

    pred

    The predicate which must hold for the resulting node.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    A node with the predicate pred or None if either

    1. there is no node with pred or
    2. there exists no path to such a node or
    3. there exists a path to such a node but due to withSubgraph settings this path was out of scope.
    Definition Classes
    TraverserMethods
  40. final def flatMap[B](f: (GraphTraversal.EdgeT) => IterableOnce[B]): Iterable[B]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
  41. def flatten[B](implicit asIterable: (GraphTraversal.EdgeT) => IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  42. def fold[A1 >: GraphTraversal.EdgeT](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  43. final def foldLeft[B](z: B)(op: (B, GraphTraversal.EdgeT) => B): B
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
  44. def foldRight[B](z: B)(op: (GraphTraversal.EdgeT, B) => B): B
    Definition Classes
    IterableOnceOps
  45. final def forall(p: (GraphTraversal.EdgeT) => Boolean): Boolean
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
  46. final def foreach[U](f: (GraphTraversal.EdgeT) => U): Unit
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
  47. def fromSpecific(coll: IterableOnce[GraphTraversal.EdgeT]): Iterable[GraphTraversal.EdgeT]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  48. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  49. def groupBy[K](f: (GraphTraversal.EdgeT) => K): Map[K, Iterable[GraphTraversal.EdgeT]]
    Definition Classes
    IterableOps
  50. def groupMap[K, B](key: (GraphTraversal.EdgeT) => K)(f: (GraphTraversal.EdgeT) => B): Map[K, Iterable[B]]
    Definition Classes
    IterableOps
  51. def groupMapReduce[K, B](key: (GraphTraversal.EdgeT) => K)(f: (GraphTraversal.EdgeT) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  52. def grouped(size: Int): Iterator[Iterable[GraphTraversal.EdgeT]]
    Definition Classes
    IterableOps
  53. final def hasPredecessor[U](potentialPredecessor: NodeT)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Boolean

    Checks whether potentialPredecessor is a predecessor of root considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Checks whether potentialPredecessor is a predecessor of root considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. Same as isSuccessorOf.

    potentialPredecessor

    The node which is potentially a predecessor of root.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    true if a path exists from potentialPredecessor to root and it had not to be excluded due to subgraph properties.

    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  54. final def hasSuccessor[U](potentialSuccessor: NodeT)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Boolean

    Checks whether potentialSuccessor is a successor of this node considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Checks whether potentialSuccessor is a successor of this node considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. Same as isPredecessorOf.

    potentialSuccessor

    The node which is potentially a successor of this node.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    true if a path exists from this node to potentialSuccessor and it had not to be excluded due to a subgraph* restriction.

    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  55. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  56. final def head: GraphTraversal.EdgeT
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps
  57. final def headOption: Option[GraphTraversal.EdgeT]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps
  58. def init: Iterable[GraphTraversal.EdgeT]
    Definition Classes
    IterableOps
  59. def inits: Iterator[Iterable[GraphTraversal.EdgeT]]
    Definition Classes
    IterableOps
  60. final def isConnectedWith[U](potentialConnected: NodeT)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Boolean

    Checks whether potentialConnected is a node (not necessarily directly) connected with root by any number of edges with any direction considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Checks whether potentialConnected is a node (not necessarily directly) connected with root by any number of edges with any direction considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. For directed or mixed graphs it is satisfactory that potentialConnected is weakly connected with root.

    potentialConnected

    The node which is potentially connected with root.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    true if a path exists from this node to potentialConnected and it had not to be excluded due to subgraph properties.

    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  61. final def isEmpty: Boolean
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
  62. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  63. final def isPredecessorOf[U](potentialSuccessor: NodeT)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Boolean

    Same as hasSuccessor.

    Same as hasSuccessor.

    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  64. final def isSuccessorOf[U](potentialPredecessor: NodeT)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Boolean

    Same as hasPredecessor.

    Same as hasPredecessor.

    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  65. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  66. def iterableFactory: IterableFactory[Vector]
    Definition Classes
    ForeachBasedDetachingIterable → Iterable → IterableOps
  67. def iterator: Iterator[GraphTraversal.EdgeT]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnce
  68. def knownSize: Int
    Definition Classes
    IterableOnce
  69. def last: GraphTraversal.EdgeT
    Definition Classes
    IterableOps
  70. def lastOption: Option[GraphTraversal.EdgeT]
    Definition Classes
    IterableOps
  71. def lazyZip[B](that: Iterable[B]): LazyZip2[GraphTraversal.EdgeT, B, InnerEdgeTraverser.this.type]
    Definition Classes
    Iterable
  72. final def map[B](f: (GraphTraversal.EdgeT) => B): Iterable[B]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
  73. final def max[B >: GraphTraversal.EdgeT](implicit ord: Ordering[B]): GraphTraversal.EdgeT
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
  74. final def maxBy[B](f: (GraphTraversal.EdgeT) => B)(implicit cmp: Ordering[B]): GraphTraversal.EdgeT
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
  75. final def maxByOption[B](f: (GraphTraversal.EdgeT) => B)(implicit cmp: Ordering[B]): Option[GraphTraversal.EdgeT]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
    Annotations
    @inline()
  76. final def maxOption[B >: GraphTraversal.EdgeT](implicit ord: Ordering[B]): Option[GraphTraversal.EdgeT]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
    Annotations
    @inline()
  77. def maxWeight: Option[Weight]

    An optional maximum weight that limits the scope of the traversal or search.

    An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

    Definition Classes
    Properties
  78. final def min[B >: GraphTraversal.EdgeT](implicit ord: Ordering[B]): GraphTraversal.EdgeT
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
    Annotations
    @inline()
  79. final def minBy[B](f: (GraphTraversal.EdgeT) => B)(implicit cmp: Ordering[B]): GraphTraversal.EdgeT
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
  80. final def minByOption[B](f: (GraphTraversal.EdgeT) => B)(implicit cmp: Ordering[B]): Option[GraphTraversal.EdgeT]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
    Annotations
    @inline()
  81. final def minOption[B >: GraphTraversal.EdgeT](implicit ord: Ordering[B]): Option[GraphTraversal.EdgeT]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
    Annotations
    @inline()
  82. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  83. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  84. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  85. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  86. def newSpecificBuilder: Builder[GraphTraversal.EdgeT, Iterable[GraphTraversal.EdgeT]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  87. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  88. final def nonOverflowingOrderMultipliedBy_2: Int
    Attributes
    protected
    Definition Classes
    Traverser
  89. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  90. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  91. def partition(p: (GraphTraversal.EdgeT) => Boolean): (Iterable[GraphTraversal.EdgeT], Iterable[GraphTraversal.EdgeT])
    Definition Classes
    IterableOps
  92. def partitionMap[A1, A2](f: (GraphTraversal.EdgeT) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  93. final def pathTo[U](potentialSuccessor: NodeT)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[Path]

    Finds a path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds a path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    potentialSuccessor

    The node a path is to be found to.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    A path to potentialSuccessor or None if either

    1. there is no node with pred or
    2. there exists no path to such a node
    Definition Classes
    TraverserMethods
  94. final def product[B >: GraphTraversal.EdgeT](implicit num: Numeric[B]): B
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
    Annotations
    @inline()
  95. final def reduce[B >: GraphTraversal.EdgeT](op: (B, B) => B): B
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
    Annotations
    @inline()
  96. final def reduceLeft[B >: GraphTraversal.EdgeT](op: (B, GraphTraversal.EdgeT) => B): B
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
  97. final def reduceLeftOption[B >: GraphTraversal.EdgeT](op: (B, GraphTraversal.EdgeT) => B): Option[B]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
    Annotations
    @inline()
  98. final def reduceOption[B >: GraphTraversal.EdgeT](op: (B, B) => B): Option[B]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
    Annotations
    @inline()
  99. def reduceRight[B >: GraphTraversal.EdgeT](op: (GraphTraversal.EdgeT, B) => B): B
    Definition Classes
    IterableOnceOps
  100. def reduceRightOption[B >: GraphTraversal.EdgeT](op: (GraphTraversal.EdgeT, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  101. final def requireSuccessors[A](block: => A): A
    Attributes
    protected
    Definition Classes
    TraverserMethods
  102. def reversed: Iterable[GraphTraversal.EdgeT]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  103. def scan[B >: GraphTraversal.EdgeT](z: B)(op: (B, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  104. final def scanLeft[B](z: B)(op: (B, GraphTraversal.EdgeT) => B): CC[B]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
  105. def scanRight[B](z: B)(op: (GraphTraversal.EdgeT, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  106. final def shortestPathTo[T](potentialSuccessor: NodeT, weight: (GraphTraversal.EdgeT) => T)(implicit arg0: Numeric[T]): Option[Path]

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. The calculation is based on the weight of the edges on the path. Edges have a default weight of 1L that can be overridden by custom edges. A weight function yielding any numeric type may also be passed to shortestPathTo.

    potentialSuccessor

    The node the shortest path is to be found to.

    weight

    Function to determine the weight of edges. If supplied, this function takes precedence over edge weights.

    returns

    The shortest path to potentialSuccessor or None if either

    1. there exists no path to potentialSuccessor or
    2. there exists a path to potentialSuccessor but due to withSubgraph settings this path was out of scope.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  107. final def shortestPathTo[U](potentialSuccessor: NodeT)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[Path]

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. The calculation is based on the weight of the edges on the path. Edges have a default weight of 1L that can be overridden by custom edges. A weight function yielding any numeric type may also be passed to shortestPathTo.

    potentialSuccessor

    The node the shortest path is to be found to.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    The shortest path to potentialSuccessor or None if either

    1. there exists no path to potentialSuccessor or
    2. there exists a path to potentialSuccessor but due to withSubgraph settings this path was out of scope.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  108. final def size: Int
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
  109. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  110. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  111. final def sizeHint: Int
    Attributes
    protected
  112. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  113. final def slice(from: Int, until: Int): CC[GraphTraversal.EdgeT]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
  114. def sliding(size: Int, step: Int): Iterator[Iterable[GraphTraversal.EdgeT]]
    Definition Classes
    IterableOps
  115. def sliding(size: Int): Iterator[Iterable[GraphTraversal.EdgeT]]
    Definition Classes
    IterableOps
  116. final def span(p: (GraphTraversal.EdgeT) => Boolean): (CC[GraphTraversal.EdgeT], CC[GraphTraversal.EdgeT])
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
  117. final def splitAt(n: Int): (CC[GraphTraversal.EdgeT], CC[GraphTraversal.EdgeT])
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
  118. def stepper[S <: Stepper[_]](implicit shape: StepperShape[GraphTraversal.EdgeT, S]): S
    Definition Classes
    IterableOnce
  119. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
    Annotations
    @deprecatedOverriding()
  120. final def sum[B >: GraphTraversal.EdgeT](implicit num: Numeric[B]): B
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
    Annotations
    @inline()
  121. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  122. def tail: Iterable[GraphTraversal.EdgeT]
    Definition Classes
    IterableOps
  123. def tails: Iterator[Iterable[GraphTraversal.EdgeT]]
    Definition Classes
    IterableOps
  124. final def take(n: Int): Iterable[GraphTraversal.EdgeT]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
  125. def takeRight(n: Int): Iterable[GraphTraversal.EdgeT]
    Definition Classes
    IterableOps
  126. final def takeWhile(p: (GraphTraversal.EdgeT) => Boolean): CC[GraphTraversal.EdgeT]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
  127. def tapEach[U](f: (GraphTraversal.EdgeT) => U): Iterable[GraphTraversal.EdgeT]
    Definition Classes
    IterableOps → IterableOnceOps
  128. final def to[CC[N, E <: Edge[N]] <: AnyGraph[N, E] with GraphLike[N, E, CC]](factory: GenericGraphCoreFactory[CC]): CC[N, E]

    Completes a traversal and creates a new connected graph populated with the elements visited.

    Completes a traversal and creates a new connected graph populated with the elements visited.

    Definition Classes
    Traverser
  129. final def to[C1](factory: Factory[GraphTraversal.EdgeT, C1]): C1
    Definition Classes
    ForeachBasedDetachingIterable → IterableOnceOps
  130. def toArray[B >: GraphTraversal.EdgeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  131. final def toBuffer[B >: GraphTraversal.EdgeT]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  132. def toIndexedSeq: IndexedSeq[GraphTraversal.EdgeT]
    Definition Classes
    IterableOnceOps
  133. final def toInnerElemTraverser(root: NodeT): InnerElemTraverser
    Definition Classes
    FluentProperties
  134. def toList: List[GraphTraversal.EdgeT]
    Definition Classes
    IterableOnceOps
  135. def toMap[K, V](implicit ev: <:<[GraphTraversal.EdgeT, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  136. def toSeq: Seq[GraphTraversal.EdgeT]
    Definition Classes
    IterableOnceOps
  137. def toSet[B >: GraphTraversal.EdgeT]: Set[B]
    Definition Classes
    IterableOnceOps
  138. def toString(): String
    Definition Classes
    Iterable → AnyRef → Any
  139. def toVector: Vector[GraphTraversal.EdgeT]
    Definition Classes
    IterableOnceOps
  140. def transpose[B](implicit asIterable: (GraphTraversal.EdgeT) => Iterable[B]): Iterable[Iterable[B]]
    Definition Classes
    IterableOps
  141. def unzip[A1, A2](implicit asPair: (GraphTraversal.EdgeT) => (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  142. def unzip3[A1, A2, A3](implicit asTriple: (GraphTraversal.EdgeT) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    IterableOps
  143. def view: View[GraphTraversal.EdgeT]
    Definition Classes
    IterableOps
  144. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  145. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  146. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  147. final def withDirection(direction: Direction): InnerEdgeTraverser

    Creates a new FluentProperties based on this except for an updated direction.

    Creates a new FluentProperties based on this except for an updated direction. Note that methods returning a Cycle or Path accept only Successors.

    Definition Classes
    FluentProperties
  148. def withFilter(p: (GraphTraversal.EdgeT) => Boolean): WithFilter[GraphTraversal.EdgeT, Iterable]
    Definition Classes
    IterableOps
  149. final def withKind(kind: Kind): InnerEdgeTraverser

    Creates a new FluentProperties based on this except for an updated kind.

    Creates a new FluentProperties based on this except for an updated kind.

    Definition Classes
    FluentProperties
  150. final def withMaxDepth(maxDepth: Int): InnerEdgeTraverser

    Creates a new FluentProperties based on this except for an updated maxDepth.

    Creates a new FluentProperties based on this except for an updated maxDepth.

    Definition Classes
    FluentProperties
  151. final def withMaxWeight(max: Long): InnerEdgeTraverser

    Creates a new FluentProperties based on this except for an updated maxWeight having the given max and the default weight function returning edge.weight.

    Creates a new FluentProperties based on this except for an updated maxWeight having the given max and the default weight function returning edge.weight.

    Definition Classes
    FluentProperties
  152. final def withMaxWeight[W](max: W, edgeWeight: (GraphTraversal.EdgeT) => W)(implicit arg0: Numeric[W]): InnerEdgeTraverser

    Creates a new FluentProperties based on this except for an updated maxWeight having the given max value and the given weight function.

    Creates a new FluentProperties based on this except for an updated maxWeight having the given max value and the given weight function.

    Definition Classes
    FluentProperties
  153. def withMaxWeight(maxWeight: Option[Weight]): InnerEdgeTraverser

    Creates a new FluentProperties based on this except for an updated maxWeight.

    Creates a new FluentProperties based on this except for an updated maxWeight.

    Definition Classes
    FluentProperties
  154. final def withOrdering(ordering: GraphTraversal.ElemOrdering): InnerEdgeTraverser

    Creates a new FluentProperties based on this except for an updated ordering.

    Creates a new FluentProperties based on this except for an updated ordering.

    Definition Classes
    FluentProperties
  155. final def withParameters(parameters: Parameters): InnerEdgeTraverser

    Creates a new FluentProperties based on this except for an updated parameters.

    Creates a new FluentProperties based on this except for an updated parameters.

    Definition Classes
    FluentProperties
  156. final def withRoot(root: NodeT): InnerEdgeTraverser

    Creates a new FluentProperties based on this except for an updated root.

    Creates a new FluentProperties based on this except for an updated root.

    Definition Classes
    TraverserMethods
  157. final def withSubgraph(nodes: GraphTraversal.NodePredicate = anyNode, edges: GraphTraversal.EdgePredicate = anyEdge): InnerEdgeTraverser

    Creates a new FluentProperties based on this except for an updated subgraphNodes and/or subgraphEdges.

    Creates a new FluentProperties based on this except for an updated subgraphNodes and/or subgraphEdges.

    Definition Classes
    FluentProperties
  158. def zip[B](that: IterableOnce[B]): Iterable[(GraphTraversal.EdgeT, B)]
    Definition Classes
    IterableOps
  159. def zipAll[A1 >: GraphTraversal.EdgeT, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
    Definition Classes
    IterableOps
  160. final def zipWithIndex: CC[(GraphTraversal.EdgeT, Int)]
    Definition Classes
    ForeachBasedDetachingIterable → IterableOps → IterableOnceOps

Deprecated Value Members

  1. def ++:[B >: GraphTraversal.EdgeT](that: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  2. def /:[B](z: B)(op: (B, GraphTraversal.EdgeT) => B): B
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  3. final def /:[B](z: B)(op: (B, GraphTraversal.EdgeT) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  4. def :\[B](z: B)(op: (GraphTraversal.EdgeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  5. final def :\[B](z: B)(op: (GraphTraversal.EdgeT, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  6. def aggregate[B](z: => B)(seqop: (B, GraphTraversal.EdgeT) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  7. def collectFirst[B](f: PartialFunction[GraphTraversal.EdgeT, B]): Option[B]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).collectFirst(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.collectFirst(...) instead

  8. def companion: IterableFactory[Iterable]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  9. def copyToBuffer(dest: Buffer[GraphTraversal.EdgeT]): Unit
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).copyToBuffer(dest)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.copyToBuffer(...) instead

  10. final def copyToBuffer[B >: GraphTraversal.EdgeT](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  11. def count(f: (GraphTraversal.EdgeT) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).count(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.count(...) instead

  12. def exists(f: (GraphTraversal.EdgeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).exists(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.exists(...) instead

  13. def filter(f: (GraphTraversal.EdgeT) => Boolean): Iterator[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).filter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.filter(...) instead

  14. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  15. def find(p: (GraphTraversal.EdgeT) => Boolean): Option[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead

  16. def flatMap[B](f: (GraphTraversal.EdgeT) => IterableOnce[B]): IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).flatMap(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable

  17. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead

  18. def foldLeft[B](z: B)(op: (B, GraphTraversal.EdgeT) => B): B
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  19. def foldRight[B](z: B)(op: (GraphTraversal.EdgeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  20. def forall(f: (GraphTraversal.EdgeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).forall(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.forall(...) instead

  21. def foreach[U](f: (GraphTraversal.EdgeT) => U): Unit
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foreach(...) instead

  22. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toStringFormat[InnerEdgeTraverser] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.

  23. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  24. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead

  25. def map[B](f: (GraphTraversal.EdgeT) => B): IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).map(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable

  26. def max(implicit ord: Ordering[GraphTraversal.EdgeT]): GraphTraversal.EdgeT
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).max(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.max instead

  27. def maxBy[B](f: (GraphTraversal.EdgeT) => B)(implicit cmp: Ordering[B]): GraphTraversal.EdgeT
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.maxBy(...) instead

  28. def min(implicit ord: Ordering[GraphTraversal.EdgeT]): GraphTraversal.EdgeT
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).min(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.min instead

  29. def minBy[B](f: (GraphTraversal.EdgeT) => B)(implicit cmp: Ordering[B]): GraphTraversal.EdgeT
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).minBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.minBy(...) instead

  30. def mkString: String
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  31. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  32. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  33. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).nonEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.nonEmpty instead

  34. def product(implicit num: Numeric[GraphTraversal.EdgeT]): GraphTraversal.EdgeT
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).product(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.product instead

  35. def reduce(f: (GraphTraversal.EdgeT, GraphTraversal.EdgeT) => GraphTraversal.EdgeT): GraphTraversal.EdgeT
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).reduce(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduce(...) instead

  36. def reduceLeft(f: (GraphTraversal.EdgeT, GraphTraversal.EdgeT) => GraphTraversal.EdgeT): GraphTraversal.EdgeT
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).reduceLeft(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeft(...) instead

  37. def reduceLeftOption(f: (GraphTraversal.EdgeT, GraphTraversal.EdgeT) => GraphTraversal.EdgeT): Option[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).reduceLeftOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead

  38. def reduceOption(f: (GraphTraversal.EdgeT, GraphTraversal.EdgeT) => GraphTraversal.EdgeT): Option[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).reduceOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceOption(...) instead

  39. def reduceRight(f: (GraphTraversal.EdgeT, GraphTraversal.EdgeT) => GraphTraversal.EdgeT): GraphTraversal.EdgeT
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).reduceRight(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRight(...) instead

  40. def reduceRightOption(f: (GraphTraversal.EdgeT, GraphTraversal.EdgeT) => GraphTraversal.EdgeT): Option[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).reduceRightOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRightOption(...) instead

  41. final def repr: Iterable[GraphTraversal.EdgeT]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  42. def sameElements[B >: A](that: IterableOnce[B]): Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sameElements instead

  43. def seq: InnerEdgeTraverser.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  44. def size: Int
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).size
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.size instead

  45. def sum(implicit num: Numeric[GraphTraversal.EdgeT]): GraphTraversal.EdgeT
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).sum(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sum instead

  46. def to[C1](factory: Factory[GraphTraversal.EdgeT, C1]): C1
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(factory) instead

  47. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toArray

  48. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead

  49. def toIndexedSeq: IndexedSeq[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toIndexedSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toIndexedSeq instead

  50. final def toIterable: Iterable[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  51. final def toIterable: InnerEdgeTraverser.this.type
    Definition Classes
    Iterable → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  52. def toIterator: Iterator[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead

  53. final def toIterator: Iterator[GraphTraversal.EdgeT]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  54. def toList: List[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(List) instead

  55. def toMap[K, V](implicit ev: <:<[GraphTraversal.EdgeT, (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Map) instead

  56. def toSeq: Seq[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Seq) instead

  57. def toSet[B >: A]: Set[B]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Set) instead

  58. def toStream: Stream[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(LazyList) instead

  59. final def toStream: Stream[GraphTraversal.EdgeT]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  60. final def toTraversable: Traversable[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toTraversable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  61. final def toTraversable: Traversable[GraphTraversal.EdgeT]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  62. def toVector: Vector[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Vector) instead

  63. def view(from: Int, until: Int): View[GraphTraversal.EdgeT]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

  64. def withFilter(f: (GraphTraversal.EdgeT) => Boolean): Iterator[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).withFilter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.withFilter(...) instead

  65. def →[B](y: B): (InnerEdgeTraverser, B)
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser toArrowAssoc[InnerEdgeTraverser] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from Traverser[GraphTraversal.EdgeT, InnerEdgeTraverser]

Inherited from ForeachBasedDetachingIterable[GraphTraversal.EdgeT]

Inherited from Iterable[GraphTraversal.EdgeT]

Inherited from IterableFactoryDefaults[GraphTraversal.EdgeT, Iterable]

Inherited from IterableOps[GraphTraversal.EdgeT, Iterable, Iterable[GraphTraversal.EdgeT]]

Inherited from IterableOnceOps[GraphTraversal.EdgeT, Iterable, Iterable[GraphTraversal.EdgeT]]

Inherited from IterableOnce[GraphTraversal.EdgeT]

Inherited from Properties

Inherited from SubgraphProperties

Inherited from TraverserMethods[GraphTraversal.EdgeT, InnerEdgeTraverser]

Inherited from FluentProperties[InnerEdgeTraverser]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods fromInnerEdgeTraverser to IterableOnceExtensionMethods[GraphTraversal.EdgeT]

Inherited by implicit conversion any2stringadd fromInnerEdgeTraverser to any2stringadd[InnerEdgeTraverser]

Inherited by implicit conversion StringFormat fromInnerEdgeTraverser to StringFormat[InnerEdgeTraverser]

Inherited by implicit conversion Ensuring fromInnerEdgeTraverser to Ensuring[InnerEdgeTraverser]

Inherited by implicit conversion ArrowAssoc fromInnerEdgeTraverser to ArrowAssoc[InnerEdgeTraverser]

Ungrouped