scalax.collection.GraphTraversal

TraverserMethods

abstract class TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]

The root-related methods Traverser will inherit.

Attributes
protected
Self Type
This with Properties
Linear Supertypes
FluentProperties[This], AnyRef, Any
Known Subclasses
InnerEdgeTraverser, InnerEdgeTraverser, InnerElemTraverser, InnerElemTraverser, InnerNodeDownUpTraverser, InnerNodeDownUpTraverser, InnerNodeTraverser, InnerNodeTraverser, OuterEdgeTraverser, OuterEdgeTraverser, OuterElemTraverser, OuterElemTraverser, OuterNodeDownUpTraverser, OuterNodeDownUpTraverser, OuterNodeTraverser, OuterNodeTraverser, Traverser
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. TraverserMethods
  2. FluentProperties
  3. AnyRef
  4. Any
Implicitly
  1. by anyToNode
  2. by EdgeAssoc
  3. by any2stringadd
  4. by any2stringfmt
  5. by any2ArrowAssoc
  6. by any2Ensuring
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new TraverserMethods()

Abstract Value Members

  1. abstract def edgeVisitor[U](f: (A) ⇒ U): (GraphTraversal.EdgeT) ⇒ Unit

    Attributes
    protected

  2. abstract def findCycle(implicit visitor: (A) ⇒ Unit = emptyVisitor): Option[Cycle]

    Finds a cycle starting the search at root taking optional filters and visitors into account.

    Finds a cycle starting the search at root taking optional filters and visitors 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.

  3. abstract def newTraverser: (NodeT, Parameters, (NodeT) ⇒ Boolean, (GraphTraversal.EdgeT) ⇒ Boolean, GraphTraversal.ElemOrdering) ⇒ This

    Attributes
    protected
    Definition Classes
    FluentProperties

  4. abstract def nodeVisitor[U](f: (A) ⇒ U): (NodeT) ⇒ VisitorReturn

    Attributes
    protected

  5. abstract def pathUntil(pred: (NodeT) ⇒ Boolean)(implicit visitor: (A) ⇒ Unit = emptyVisitor): 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 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 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.

  6. abstract def root: NodeT

  7. abstract def shortestPathTo[T](potentialSuccessor: NodeT, weight: (GraphTraversal.EdgeT) ⇒ T, visitor: (A) ⇒ Unit)(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 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 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.

Concrete Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd

  5. def ->[B](y: B): (TraverserMethods[A, This], B)

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to ArrowAssoc[TraverserMethods[A, This]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

  6. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  7. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  9. final def chose[U](f: (NodeT) ⇒ U, legacy: (NodeT) ⇒ VisitorReturn): (NodeT) ⇒ VisitorReturn

    Attributes
    protected
    Annotations
    @inline()

  10. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  11. final def emptyVisitor(a: A): Unit

    Attributes
    protected
    Annotations
    @inline()

  12. def ensuring(cond: (TraverserMethods[A, This]) ⇒ Boolean, msg: ⇒ Any): TraverserMethods[A, This]

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to Ensuring[TraverserMethods[A, This]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  13. def ensuring(cond: (TraverserMethods[A, This]) ⇒ Boolean): TraverserMethods[A, This]

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to Ensuring[TraverserMethods[A, This]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  14. def ensuring(cond: Boolean, msg: ⇒ Any): TraverserMethods[A, This]

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to Ensuring[TraverserMethods[A, This]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  15. def ensuring(cond: Boolean): TraverserMethods[A, This]

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to Ensuring[TraverserMethods[A, This]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  16. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  17. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  18. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  19. final def findConnected(pred: (NodeT) ⇒ Boolean)(implicit visitor: (A) ⇒ Unit = emptyVisitor): 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 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 innerNodeTraverser or altered by any with* method. For directed or mixed graphs the node to be found is weekly 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.

  20. final def findPredecessor(pred: (NodeT) ⇒ Boolean)(implicit visitor: (A) ⇒ Unit = emptyVisitor): Option[NodeT]

    Finds a predecessor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like 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 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.

  21. final def findSuccessor(pred: (NodeT) ⇒ Boolean)(implicit visitor: (A) ⇒ Unit = emptyVisitor): Option[NodeT]

    Finds a successor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like 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 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 returden.

    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.

  22. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

  23. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  24. final def hasPredecessor(potentialPredecessor: NodeT)(implicit visitor: (A) ⇒ Unit = emptyVisitor): Boolean

    Checks whether potentialPredecessor is a predecessor of root considering all traversal properties passed to the traverser factory method like 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 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.

    Annotations
    @inline()

  25. final def hasSuccessor(potentialSuccessor: NodeT)(implicit visitor: (A) ⇒ Unit = emptyVisitor): Boolean

    Checks whether potentialSuccessor is a successor of this node considering all traversal properties passed to the traverser factory method like 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 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.

    Annotations
    @inline()

  26. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  27. final def isConnectedWith(potentialConnected: NodeT)(implicit visitor: (A) ⇒ Unit = emptyVisitor): 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 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 innerNodeTraverser or altered by any with* method. For directed or mixed graphs it is satisfactory that potentialConnected is weekly 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.

    Annotations
    @inline()

  28. def isDefined: Boolean

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to OuterNode[TraverserMethods[A, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param

  29. def isEdge: Boolean

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to OuterNode[TraverserMethods[A, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam

  30. def isIn: Boolean

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to OuterNode[TraverserMethods[A, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param

  31. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  32. def isNode: Boolean

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to OuterNode[TraverserMethods[A, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam

  33. def isOut: Boolean

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to OuterNode[TraverserMethods[A, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param

  34. final def isPredecessorOf(potentialSuccessor: NodeT)(implicit visitor: (A) ⇒ Unit = emptyVisitor): Boolean

    Same as hasSuccessor.

    Same as hasSuccessor.

    Annotations
    @inline()

  35. final def isSuccessorOf(potentialPredecessor: NodeT)(implicit visitor: (A) ⇒ Unit = emptyVisitor): Boolean

    Same as hasPredecessor.

    Same as hasPredecessor.

    Annotations
    @inline()

  36. val n1: TraverserMethods[A, This]

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to EdgeAssoc[TraverserMethods[A, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc

  37. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  38. final def notify(): Unit

    Definition Classes
    AnyRef

  39. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  40. final def pathTo(potentialSuccessor: NodeT)(implicit visitor: (A) ⇒ Unit = emptyVisitor): Option[Path]

    Finds a path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like 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 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

  41. 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 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 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.
    Annotations
    @inline()

  42. final def shortestPathTo(potentialSuccessor: NodeT)(implicit visitor: (A) ⇒ Unit = emptyVisitor): Option[Path]

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like 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 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.
    Annotations
    @inline()

  43. def stringPrefix: String

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to OuterNode[TraverserMethods[A, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam

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

    Definition Classes
    AnyRef

  45. final def toInnerElemTraverser(root: NodeT): InnerElemTraverser

    Definition Classes
    FluentProperties

  46. def toString(): String

    Definition Classes
    AnyRef → Any

  47. val value: TraverserMethods[A, This]

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to OuterNode[TraverserMethods[A, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam

  48. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  50. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  51. final def withDirection(direction: Direction): This

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

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

    Definition Classes
    FluentProperties

  52. final def withKind(kind: Kind): This

    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

  53. final def withMaxDepth(maxDepth: Int): This

    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

  54. final def withOrdering(ordering: GraphTraversal.ElemOrdering): This

    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

  55. final def withParameters(parameters: Parameters): This

    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

  56. final def withRoot(root: NodeT): This

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

  57. final def withSubgraph(nodes: (NodeT) ⇒ Boolean = anyNode, edges: (GraphTraversal.EdgeT) ⇒ Boolean = anyEdge): This

    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

  58. def ~[N >: N1, N2 <: N](n2: N2): UnDiEdge[N]

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to EdgeAssoc[TraverserMethods[A, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

  59. def ~>[N >: N1, N2 <: N](n2: N2): DiEdge[N]

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to EdgeAssoc[TraverserMethods[A, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

  60. def →[B](y: B): (TraverserMethods[A, This], B)

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to ArrowAssoc[TraverserMethods[A, This]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. val self: Any

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (traverserMethods: StringAdd).self
    Definition Classes
    StringAdd

  2. val self: Any

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (traverserMethods: StringFormat).self
    Definition Classes
    StringFormat

  3. def toString(): String

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to OuterNode[TraverserMethods[A, This]] 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:
    (traverserMethods: OuterNode[TraverserMethods[A, This]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

Deprecated Value Members

  1. def x: TraverserMethods[A, This]

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to ArrowAssoc[TraverserMethods[A, This]] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (traverserMethods: ArrowAssoc[TraverserMethods[A, This]]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  2. def x: TraverserMethods[A, This]

    Implicit information
    This member is added by an implicit conversion from TraverserMethods[A, This] to Ensuring[TraverserMethods[A, This]] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (traverserMethods: Ensuring[TraverserMethods[A, This]]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from FluentProperties[This]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from TraverserMethods[A, This] to OuterNode[TraverserMethods[A, This]]

Inherited by implicit conversion EdgeAssoc from TraverserMethods[A, This] to EdgeAssoc[TraverserMethods[A, This]]

Inherited by implicit conversion any2stringadd from TraverserMethods[A, This] to StringAdd

Inherited by implicit conversion any2stringfmt from TraverserMethods[A, This] to StringFormat

Inherited by implicit conversion any2ArrowAssoc from TraverserMethods[A, This] to ArrowAssoc[TraverserMethods[A, This]]

Inherited by implicit conversion any2Ensuring from TraverserMethods[A, This] to Ensuring[TraverserMethods[A, This]]

Ungrouped