Packages

c

scalax.collection.GraphTraversalImpl

OuterNodeDownUpTraverser

case class OuterNodeDownUpTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#OuterNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, N), (GraphTraversalImpl.this)#OuterNodeDownUpTraverser] with Product with Serializable

Attributes
protected
Linear Supertypes
Serializable, Serializable, Product, Equals, (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, N), (GraphTraversalImpl.this)#OuterNodeDownUpTraverser], (GraphTraversalImpl.this)#Impl[(Boolean, N), (GraphTraversalImpl.this)#OuterNodeDownUpTraverser], (GraphTraversalImpl.this)#OuterNodeDownUpTraverser, (GraphTraversalImpl.this)#Traverser[(Boolean, N), (GraphTraversalImpl.this)#OuterNodeDownUpTraverser], Traversable[(Boolean, N)], GenTraversable[(Boolean, N)], GenericTraversableTemplate[(Boolean, N), Traversable], TraversableLike[(Boolean, N), Traversable[(Boolean, N)]], GenTraversableLike[(Boolean, N), Traversable[(Boolean, N)]], Parallelizable[(Boolean, N), ParIterable[(Boolean, N)]], TraversableOnce[(Boolean, N)], GenTraversableOnce[(Boolean, N)], FilterMonadic[(Boolean, N), Traversable[(Boolean, N)]], HasNewBuilder[(Boolean, N), Traversable[(Boolean, N)]], (GraphTraversalImpl.this)#Properties, (GraphTraversalImpl.this)#SubgraphProperties, (GraphTraversalImpl.this)#TraverserMethods[(Boolean, N), (GraphTraversalImpl.this)#OuterNodeDownUpTraverser], (GraphTraversalImpl.this)#FluentProperties[(GraphTraversalImpl.this)#OuterNodeDownUpTraverser], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. OuterNodeDownUpTraverser
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. DownUpTraverser
  7. Impl
  8. OuterNodeDownUpTraverser
  9. Traverser
  10. Traversable
  11. GenTraversable
  12. GenericTraversableTemplate
  13. TraversableLike
  14. GenTraversableLike
  15. Parallelizable
  16. TraversableOnce
  17. GenTraversableOnce
  18. FilterMonadic
  19. HasNewBuilder
  20. Properties
  21. SubgraphProperties
  22. TraverserMethods
  23. FluentProperties
  24. AnyRef
  25. 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 OuterNodeDownUpTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None)

Type Members

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

Value Members

  1. def ++[B >: (Boolean, N), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(Boolean, N)], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  2. def ++:[B >: (Boolean, N), That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[(Boolean, N)], B, That]): That
    Definition Classes
    TraversableLike
  3. def ++:[B >: (Boolean, N), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(Boolean, N)], B, That]): That
    Definition Classes
    TraversableLike
  4. def /:[B](z: B)(op: (B, (Boolean, N)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  5. def :\[B](z: B)(op: ((Boolean, N), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  6. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  7. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  8. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  9. def aggregate[B](z: ⇒ B)(seqop: (B, (Boolean, N)) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. def collect[B, That](pf: PartialFunction[(Boolean, N), B])(implicit bf: CanBuildFrom[Traversable[(Boolean, N)], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  11. def collectFirst[B](pf: PartialFunction[(Boolean, N), B]): Option[B]
    Definition Classes
    TraversableOnce
  12. def companion: GenericCompanion[Traversable]
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate
  13. def copyToArray[B >: (Boolean, N)](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  14. def copyToArray[B >: (Boolean, N)](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  15. def copyToArray[B >: (Boolean, N)](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  16. def copyToBuffer[B >: (Boolean, N)](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  17. def count(p: ((Boolean, N)) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  18. def drop(n: Int): Traversable[(Boolean, N)]
    Definition Classes
    TraversableLike → GenTraversableLike
  19. def dropWhile(p: ((Boolean, N)) ⇒ Boolean): Traversable[(Boolean, N)]
    Definition Classes
    TraversableLike → GenTraversableLike
  20. def exists(p: ((Boolean, N)) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  21. final def fUnit[U](f: ((Boolean, N)) ⇒ U): ((Boolean, N)) ⇒ Unit
    Definition Classes
    DownUpTraverser
  22. def filter(p: ((Boolean, N)) ⇒ Boolean): Traversable[(Boolean, N)]
    Definition Classes
    TraversableLike → GenTraversableLike
  23. def filterNot(p: ((Boolean, N)) ⇒ Boolean): Traversable[(Boolean, N)]
    Definition Classes
    TraversableLike → GenTraversableLike
  24. def find(p: ((Boolean, N)) ⇒ Boolean): Option[(Boolean, N)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  25. final def findConnected[U](pred: (GraphTraversalImpl.this)#NodeFilter)(implicit visitor: ((Boolean, N)) ⇒ U = empty): Option[(GraphTraversalImpl.this)#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
  26. final def findCycle[U](implicit visitor: ((Boolean, N)) ⇒ U = empty): Option[(GraphTraversalImpl.this)#Cycle]

    Finds a cycle starting the search at root $INTOACC, if any.

    Finds a cycle starting the search at root $INTOACC, if any. The resulting cycle may start at any node connected with this node.

    visitor

    $OPTVISITOR

    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
    Impl → TraverserMethods
  27. final def findPredecessor[U](pred: (GraphTraversalImpl.this)#NodeFilter)(implicit visitor: ((Boolean, N)) ⇒ U = empty): Option[(GraphTraversalImpl.this)#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
  28. final def findSuccessor[U](pred: (GraphTraversalImpl.this)#NodeFilter)(implicit visitor: ((Boolean, N)) ⇒ U = empty): Option[(GraphTraversalImpl.this)#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
  29. def flatMap[B, That](f: ((Boolean, N)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(Boolean, N)], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  30. def flatten[B](implicit asTraversable: ((Boolean, N)) ⇒ GenTraversableOnce[B]): Traversable[B]
    Definition Classes
    GenericTraversableTemplate
  31. def fold[A1 >: (Boolean, N)](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def foldLeft[B](z: B)(op: (B, (Boolean, N)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def foldRight[B](z: B)(op: ((Boolean, N), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  34. def forall(p: ((Boolean, N)) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  35. final def foreach[U](f: ((Boolean, N)) ⇒ U): Unit
    Definition Classes
    OuterNodeDownUpTraverser → Traverser → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  36. def genericBuilder[B]: Builder[B, Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
  37. def groupBy[K](f: ((Boolean, N)) ⇒ K): Map[K, Traversable[(Boolean, N)]]
    Definition Classes
    TraversableLike → GenTraversableLike
  38. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  39. final def hasPredecessor[U](potentialPredecessor: (GraphTraversalImpl.this)#NodeT)(implicit visitor: ((Boolean, N)) ⇒ 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()
  40. final def hasSuccessor[U](potentialSuccessor: (GraphTraversalImpl.this)#NodeT)(implicit visitor: ((Boolean, N)) ⇒ 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()
  41. def head: (Boolean, N)
    Definition Classes
    TraversableLike → GenTraversableLike
  42. def headOption: Option[(Boolean, N)]
    Definition Classes
    TraversableLike → GenTraversableLike
  43. def init: Traversable[(Boolean, N)]
    Definition Classes
    TraversableLike → GenTraversableLike
  44. def inits: Iterator[Traversable[(Boolean, N)]]
    Definition Classes
    TraversableLike
  45. final def isConnectedWith[U](potentialConnected: (GraphTraversalImpl.this)#NodeT)(implicit visitor: ((Boolean, N)) ⇒ 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()
  46. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to OuterNode[(GraphTraversalImpl.this)#OuterNodeDownUpTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  47. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to OuterNode[(GraphTraversalImpl.this)#OuterNodeDownUpTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  48. def isEmpty: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  49. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to OuterNode[(GraphTraversalImpl.this)#OuterNodeDownUpTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  50. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to OuterNode[(GraphTraversalImpl.this)#OuterNodeDownUpTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  51. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to OuterNode[(GraphTraversalImpl.this)#OuterNodeDownUpTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  52. final def isPredecessorOf[U](potentialSuccessor: (GraphTraversalImpl.this)#NodeT)(implicit visitor: ((Boolean, N)) ⇒ U = empty): Boolean

    Same as hasSuccessor.

    Same as hasSuccessor.

    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  53. final def isSuccessorOf[U](potentialPredecessor: (GraphTraversalImpl.this)#NodeT)(implicit visitor: ((Boolean, N)) ⇒ U = empty): Boolean

    Same as hasPredecessor.

    Same as hasPredecessor.

    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  54. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  55. def last: (Boolean, N)
    Definition Classes
    TraversableLike → GenTraversableLike
  56. def lastOption: Option[(Boolean, N)]
    Definition Classes
    TraversableLike → GenTraversableLike
  57. def map[B, That](f: ((Boolean, N)) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(Boolean, N)], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  58. def max[B >: (Boolean, N)](implicit cmp: Ordering[B]): (Boolean, N)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  59. def maxBy[B](f: ((Boolean, N)) ⇒ B)(implicit cmp: Ordering[B]): (Boolean, N)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  60. val maxWeight: Option[(GraphTraversalImpl.this)#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
    OuterNodeDownUpTraverser → Properties
  61. def min[B >: (Boolean, N)](implicit cmp: Ordering[B]): (Boolean, N)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  62. def minBy[B](f: ((Boolean, N)) ⇒ B)(implicit cmp: Ordering[B]): (Boolean, N)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  63. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  64. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  65. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  66. val n1: (GraphTraversalImpl.this)#OuterNodeDownUpTraverser
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to EdgeAssoc[(GraphTraversalImpl.this)#OuterNodeDownUpTraverser] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  67. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. val ordering: (GraphTraversalImpl.this)#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
    OuterNodeDownUpTraverser → Properties
  69. def par: ParIterable[(Boolean, N)]
    Definition Classes
    Parallelizable
  70. val parameters: Parameters

    The properties controlling subsequent traversals.

    The properties controlling subsequent traversals.

    Definition Classes
    OuterNodeDownUpTraverser → Properties
  71. final def partOfCycle[U](implicit visitor: ((Boolean, N)) ⇒ U = empty): Option[(GraphTraversalImpl.this)#Cycle]

    Finds a cycle that contains root $INTOACC.

    Finds a cycle that contains root $INTOACC. Irrespective of the current setting for kind, DepthFirst is used internally.

    visitor

    $OPTVISITOR

    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
    Impl → TraverserMethods
  72. def partition(p: ((Boolean, N)) ⇒ Boolean): (Traversable[(Boolean, N)], Traversable[(Boolean, N)])
    Definition Classes
    TraversableLike → GenTraversableLike
  73. final def pathTo[U](potentialSuccessor: (GraphTraversalImpl.this)#NodeT)(implicit visitor: ((Boolean, N)) ⇒ U = empty): Option[(GraphTraversalImpl.this)#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
  74. final def pathUntil[U](pred: (GraphTraversalImpl.this)#NodeFilter)(implicit visitor: ((Boolean, N)) ⇒ U = empty): Option[(GraphTraversalImpl.this)#Path]

    Finds a path from root to a successor of root for which pred holds $CONSIDERING root itself does not count as a match.

    Finds a path from root to a successor of root for which pred holds $CONSIDERING 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

    $OPTVISITOR

    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
    Impl → TraverserMethods
  75. def product[B >: (Boolean, N)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  76. def reduce[A1 >: (Boolean, N)](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  77. def reduceLeft[B >: (Boolean, N)](op: (B, (Boolean, N)) ⇒ B): B
    Definition Classes
    TraversableOnce
  78. def reduceLeftOption[B >: (Boolean, N)](op: (B, (Boolean, N)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. def reduceOption[A1 >: (Boolean, N)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  80. def reduceRight[B >: (Boolean, N)](op: ((Boolean, N), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  81. def reduceRightOption[B >: (Boolean, N)](op: ((Boolean, N), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  82. def repr: Traversable[(Boolean, N)]
    Definition Classes
    TraversableLike → GenTraversableLike
  83. val root: (GraphTraversalImpl.this)#NodeT

    The node where subsequent graph traversals start.

    The node where subsequent graph traversals start.

    Definition Classes
    OuterNodeDownUpTraverser → Properties → TraverserMethods
  84. def scan[B >: (Boolean, N), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[(Boolean, N)], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  85. def scanLeft[B, That](z: B)(op: (B, (Boolean, N)) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(Boolean, N)], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  86. def scanRight[B, That](z: B)(op: ((Boolean, N), B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(Boolean, N)], 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.

  87. def seq: Traversable[(Boolean, N)]
    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  88. final def shortestPathTo[T, U](potentialSuccessor: (GraphTraversalImpl.this)#NodeT, weight: ((GraphTraversalImpl.this)#EdgeT) ⇒ T, visitor: ((Boolean, N)) ⇒ U)(implicit arg0: Numeric[T]): Option[(GraphTraversalImpl.this)#Path]

    Finds the shortest path from root to potentialSuccessor $CONSIDERING The calculation is based on the weight of the edges on the path.

    Finds the shortest path from root to potentialSuccessor $CONSIDERING 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

    $OPTVISITOR

    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
    Impl → TraverserMethods
  89. final def shortestPathTo[T](potentialSuccessor: (GraphTraversalImpl.this)#NodeT, weight: ((GraphTraversalImpl.this)#EdgeT) ⇒ T)(implicit arg0: Numeric[T]): Option[(GraphTraversalImpl.this)#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()
  90. final def shortestPathTo[U](potentialSuccessor: (GraphTraversalImpl.this)#NodeT)(implicit visitor: ((Boolean, N)) ⇒ U = empty): Option[(GraphTraversalImpl.this)#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()
  91. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def slice(from: Int, until: Int): Traversable[(Boolean, N)]
    Definition Classes
    TraversableLike → GenTraversableLike
  93. def span(p: ((Boolean, N)) ⇒ Boolean): (Traversable[(Boolean, N)], Traversable[(Boolean, N)])
    Definition Classes
    TraversableLike → GenTraversableLike
  94. def splitAt(n: Int): (Traversable[(Boolean, N)], Traversable[(Boolean, N)])
    Definition Classes
    TraversableLike → GenTraversableLike
  95. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  96. final def strongComponents[U](implicit visitor: ((Boolean, N)) ⇒ U = empty): Iterable[(GraphTraversalImpl.this)#Component]

    Finds all strongly connected components reachable from this node.

    Finds all strongly connected components reachable from this node. $SEEFLUENT

    visitor

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

    Definition Classes
    Impl → TraverserMethods
  97. val subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter

    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
    OuterNodeDownUpTraverser → SubgraphProperties
  98. val subgraphNodes: (GraphTraversalImpl.this)#NodeFilter

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

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

    Definition Classes
    OuterNodeDownUpTraverser → SubgraphProperties
  99. def sum[B >: (Boolean, N)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def tail: Traversable[(Boolean, N)]
    Definition Classes
    TraversableLike → GenTraversableLike
  101. def tails: Iterator[Traversable[(Boolean, N)]]
    Definition Classes
    TraversableLike
  102. def take(n: Int): Traversable[(Boolean, N)]
    Definition Classes
    TraversableLike → GenTraversableLike
  103. def takeWhile(p: ((Boolean, N)) ⇒ Boolean): Traversable[(Boolean, N)]
    Definition Classes
    TraversableLike → GenTraversableLike
  104. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (Boolean, N), Col[(Boolean, N)]]): Col[(Boolean, N)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  105. def toArray[B >: (Boolean, N)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. def toBuffer[B >: (Boolean, N)]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. final def toGraph: Graph[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
  108. def toIndexedSeq: IndexedSeq[(Boolean, N)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. final def toInnerElemTraverser(root: (GraphTraversalImpl.this)#NodeT): (GraphTraversalImpl.this)#InnerElemTraverser
    Definition Classes
    FluentProperties
  110. def toIterable: Iterable[(Boolean, N)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def toIterator: Iterator[(Boolean, N)]
    Definition Classes
    TraversableLike → GenTraversableOnce
  112. def toList: List[(Boolean, N)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def toMap[T, U](implicit ev: <:<[(Boolean, N), (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to CollectionsHaveToParArray[(GraphTraversalImpl.this)#OuterNodeDownUpTraverser, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type ((GraphTraversalImpl.this)#OuterNodeDownUpTraverser) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  115. def toSeq: Seq[(Boolean, N)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def toSet[B >: (Boolean, N)]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def toStream: Stream[(Boolean, N)]
    Definition Classes
    TraversableLike → GenTraversableOnce
  118. def toString(): String
    Definition Classes
    TraversableLike → Any
  119. def toTraversable: Traversable[(Boolean, N)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  120. def toVector: Vector[(Boolean, N)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. final def topologicalSort[U](ignorePredecessors: Boolean = false)(implicit visitor: ((GraphTraversalImpl.this)#InnerElem) ⇒ U = empty): (GraphTraversalImpl.this)#CycleNodeOrTopologicalOrder

    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. $SEEFLUENT

    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
    Impl → TraverserMethods
  122. def transpose[B](implicit asTraversable: ((Boolean, N)) ⇒ 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.

  123. def unzip[A1, A2](implicit asPair: ((Boolean, N)) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
    Definition Classes
    GenericTraversableTemplate
  124. def unzip3[A1, A2, A3](implicit asTriple: ((Boolean, N)) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
    Definition Classes
    GenericTraversableTemplate
  125. val value: (GraphTraversalImpl.this)#OuterNodeDownUpTraverser
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to OuterNode[(GraphTraversalImpl.this)#OuterNodeDownUpTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  126. def view(from: Int, until: Int): TraversableView[(Boolean, N), Traversable[(Boolean, N)]]
    Definition Classes
    TraversableLike
  127. def view: TraversableView[(Boolean, N), Traversable[(Boolean, N)]]
    Definition Classes
    TraversableLike
  128. final def weakComponent[U](implicit visitor: ((Boolean, N)) ⇒ U = empty): (GraphTraversalImpl.this)#Component

    Determines the weak component that contains this node.

    Determines the weak component that contains this node. $SEEFLUENT

    visitor

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

    Definition Classes
    Impl → TraverserMethods
  129. final def withDirection(direction: Direction): (GraphTraversalImpl.this)#OuterNodeDownUpTraverser

    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
  130. def withFilter(p: ((Boolean, N)) ⇒ Boolean): FilterMonadic[(Boolean, N), Traversable[(Boolean, N)]]
    Definition Classes
    TraversableLike → FilterMonadic
  131. final def withKind(kind: Kind): (GraphTraversalImpl.this)#OuterNodeDownUpTraverser

    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
  132. final def withMaxDepth(maxDepth: Int): (GraphTraversalImpl.this)#OuterNodeDownUpTraverser

    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
  133. final def withMaxWeight(max: Long): (GraphTraversalImpl.this)#OuterNodeDownUpTraverser

    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
  134. final def withMaxWeight[W](max: W, edgeWeight: ((GraphTraversalImpl.this)#EdgeT) ⇒ W)(implicit arg0: Numeric[W]): (GraphTraversalImpl.this)#OuterNodeDownUpTraverser

    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
  135. def withMaxWeight(maxWeight: Option[(GraphTraversalImpl.this)#Weight]): (GraphTraversalImpl.this)#OuterNodeDownUpTraverser

    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
  136. final def withOrdering(ordering: (GraphTraversalImpl.this)#ElemOrdering): (GraphTraversalImpl.this)#OuterNodeDownUpTraverser

    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
  137. final def withParameters(parameters: Parameters): (GraphTraversalImpl.this)#OuterNodeDownUpTraverser

    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
  138. final def withRoot(root: (GraphTraversalImpl.this)#NodeT): (GraphTraversalImpl.this)#OuterNodeDownUpTraverser

    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
  139. final def withSubgraph(nodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, edges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge): (GraphTraversalImpl.this)#OuterNodeDownUpTraverser

    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
  140. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to EdgeAssoc[(GraphTraversalImpl.this)#OuterNodeDownUpTraverser] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  141. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to EdgeAssoc[(GraphTraversalImpl.this)#OuterNodeDownUpTraverser] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

Shadowed Implicit Value Members

  1. def filter(p: ((Boolean, N)) ⇒ Boolean): TraversableOnce[(Boolean, N)]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to MonadOps[(Boolean, N)] 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:
    (outerNodeDownUpTraverser: MonadOps[(Boolean, N)]).filter(p)
    Definition Classes
    MonadOps
  2. def flatMap[B](f: ((Boolean, N)) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to MonadOps[(Boolean, N)] 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:
    (outerNodeDownUpTraverser: MonadOps[(Boolean, N)]).flatMap(f)
    Definition Classes
    MonadOps
  3. def map[B](f: ((Boolean, N)) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to MonadOps[(Boolean, N)] 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:
    (outerNodeDownUpTraverser: MonadOps[(Boolean, N)]).map(f)
    Definition Classes
    MonadOps
  4. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to OuterNode[(GraphTraversalImpl.this)#OuterNodeDownUpTraverser] 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:
    (outerNodeDownUpTraverser: OuterNode[(GraphTraversalImpl.this)#OuterNodeDownUpTraverser]).stringPrefix
    Definition Classes
    NodeParam
  5. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to OuterNode[(GraphTraversalImpl.this)#OuterNodeDownUpTraverser] 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:
    (outerNodeDownUpTraverser: OuterNode[(GraphTraversalImpl.this)#OuterNodeDownUpTraverser]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  6. def withFilter(p: ((Boolean, N)) ⇒ Boolean): Iterator[(Boolean, N)]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#OuterNodeDownUpTraverser to MonadOps[(Boolean, N)] 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:
    (outerNodeDownUpTraverser: MonadOps[(Boolean, N)]).withFilter(p)
    Definition Classes
    MonadOps