Packages

c

scalax.collection.GraphTraversal

InnerEdgeTraverser

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

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. InnerEdgeTraverser
  2. Traverser
  3. Traversable
  4. GenTraversable
  5. GenericTraversableTemplate
  6. TraversableLike
  7. GenTraversableLike
  8. Parallelizable
  9. TraversableOnce
  10. GenTraversableOnce
  11. FilterMonadic
  12. HasNewBuilder
  13. Properties
  14. SubgraphProperties
  15. TraverserMethods
  16. FluentProperties
  17. AnyRef
  18. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by flattenTraversableOnce
  5. by EdgeAssoc
  6. by graphParamsToPartition
  7. by any2stringadd
  8. by StringFormat
  9. by Ensuring
  10. by ArrowAssoc
  11. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new InnerEdgeTraverser()

Type Members

  1. type Self = Traversable[GraphTraversal.EdgeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def apply[U](pred: GraphTraversal.NodeFilter = 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.NodeFilter, GraphTraversal.EdgeFilter, 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 pathUntil[U](pred: GraphTraversal.NodeFilter)(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
  9. abstract def root: NodeT

    The node where subsequent graph traversals start.

    The node where subsequent graph traversals start.

    Definition Classes
    Properties
  10. 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
  11. 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
  12. abstract def subgraphEdges: GraphTraversal.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
    SubgraphProperties
  13. abstract def subgraphNodes: GraphTraversal.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
    SubgraphProperties
  14. abstract def topologicalSort[U](ignorePredecessors: Boolean = false)(implicit visitor: (GraphTraversal.InnerElem) ⇒ U = empty): 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. 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
  15. abstract def weakComponent[U](implicit visitor: (GraphTraversal.EdgeT) ⇒ U = empty): Component

    Determines the week component that contains this node.

    Determines the week 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 to any2stringadd[InnerEdgeTraverser] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ++[B >: GraphTraversal.EdgeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[GraphTraversal.EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: GraphTraversal.EdgeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[GraphTraversal.EdgeT], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: GraphTraversal.EdgeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[GraphTraversal.EdgeT], B, That]): That
    Definition Classes
    TraversableLike
  7. def ->[B](y: B): (InnerEdgeTraverser, B)
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to ArrowAssoc[InnerEdgeTraverser] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. def /:[B](z: B)(op: (B, GraphTraversal.EdgeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. def :\[B](z: B)(op: (GraphTraversal.EdgeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  12. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  14. def aggregate[B](z: ⇒ B)(seqop: (B, GraphTraversal.EdgeT) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  15. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  16. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  17. def collect[B, That](pf: PartialFunction[GraphTraversal.EdgeT, B])(implicit bf: CanBuildFrom[Traversable[GraphTraversal.EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  18. def collectFirst[B](pf: PartialFunction[GraphTraversal.EdgeT, B]): Option[B]
    Definition Classes
    TraversableOnce
  19. def companion: GenericCompanion[Traversable]
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate
  20. def copyToArray[B >: GraphTraversal.EdgeT](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  21. def copyToArray[B >: GraphTraversal.EdgeT](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  22. def copyToArray[B >: GraphTraversal.EdgeT](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  23. def copyToBuffer[B >: GraphTraversal.EdgeT](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  24. def count(p: (GraphTraversal.EdgeT) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  25. def drop(n: Int): Traversable[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  26. def dropWhile(p: (GraphTraversal.EdgeT) ⇒ Boolean): Traversable[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  27. def edgeParams: Traversable[EdgeParam]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  28. val elems: Traversable[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  29. def ensuring(cond: (InnerEdgeTraverser) ⇒ Boolean, msg: ⇒ Any): InnerEdgeTraverser
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to Ensuring[InnerEdgeTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  30. def ensuring(cond: (InnerEdgeTraverser) ⇒ Boolean): InnerEdgeTraverser
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to Ensuring[InnerEdgeTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  31. def ensuring(cond: Boolean, msg: ⇒ Any): InnerEdgeTraverser
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to Ensuring[InnerEdgeTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  32. def ensuring(cond: Boolean): InnerEdgeTraverser
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to Ensuring[InnerEdgeTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  33. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  34. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  35. def exists(p: (GraphTraversal.EdgeT) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  36. def filter(p: (GraphTraversal.EdgeT) ⇒ Boolean): Traversable[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  37. def filterNot(p: (GraphTraversal.EdgeT) ⇒ Boolean): Traversable[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  38. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  39. def find(p: (GraphTraversal.EdgeT) ⇒ Boolean): Option[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  40. final def findConnected[U](pred: GraphTraversal.NodeFilter)(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 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.
    Definition Classes
    TraverserMethods
  41. final def findPredecessor[U](pred: GraphTraversal.NodeFilter)(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
  42. final def findSuccessor[U](pred: GraphTraversal.NodeFilter)(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
  43. def flatMap[B, That](f: (GraphTraversal.EdgeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[GraphTraversal.EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  44. def flatten[B](implicit asTraversable: (GraphTraversal.EdgeT) ⇒ GenTraversableOnce[B]): Traversable[B]
    Definition Classes
    GenericTraversableTemplate
  45. def fold[A1 >: GraphTraversal.EdgeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  46. def foldLeft[B](z: B)(op: (B, GraphTraversal.EdgeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  47. def foldRight[B](z: B)(op: (GraphTraversal.EdgeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  48. def forall(p: (GraphTraversal.EdgeT) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  49. def foreach[U](f: (GraphTraversal.EdgeT) ⇒ U): Unit
    Definition Classes
    Traverser → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  50. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to StringFormat[InnerEdgeTraverser] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  51. def genericBuilder[B]: Builder[B, Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
  52. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  53. def groupBy[K](f: (GraphTraversal.EdgeT) ⇒ K): Map[K, Traversable[GraphTraversal.EdgeT]]
    Definition Classes
    TraversableLike → GenTraversableLike
  54. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  55. 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()
  56. 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()
  57. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  58. def head: GraphTraversal.EdgeT
    Definition Classes
    TraversableLike → GenTraversableLike
  59. def headOption: Option[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  60. final def ifSuccessors[A](block: ⇒ A): A
    Attributes
    protected
    Definition Classes
    TraverserMethods
  61. def init: Traversable[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  62. def inits: Iterator[Traversable[GraphTraversal.EdgeT]]
    Definition Classes
    TraversableLike
  63. 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 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.

    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  64. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to OuterNode[InnerEdgeTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  65. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to OuterNode[InnerEdgeTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  66. def isEmpty: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  67. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to OuterNode[InnerEdgeTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  68. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  69. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to OuterNode[InnerEdgeTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  70. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to OuterNode[InnerEdgeTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  71. final def isPredecessorOf[U](potentialSuccessor: NodeT)(implicit visitor: (GraphTraversal.EdgeT) ⇒ U = empty): Boolean

    Same as hasSuccessor.

    Same as hasSuccessor.

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

    Same as hasPredecessor.

    Same as hasPredecessor.

    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  73. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  74. def last: GraphTraversal.EdgeT
    Definition Classes
    TraversableLike → GenTraversableLike
  75. def lastOption: Option[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  76. def map[B, That](f: (GraphTraversal.EdgeT) ⇒ B)(implicit bf: CanBuildFrom[Traversable[GraphTraversal.EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  77. def max[B >: GraphTraversal.EdgeT](implicit cmp: Ordering[B]): GraphTraversal.EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  78. def maxBy[B](f: (GraphTraversal.EdgeT) ⇒ B)(implicit cmp: Ordering[B]): GraphTraversal.EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. 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
  80. def min[B >: GraphTraversal.EdgeT](implicit cmp: Ordering[B]): GraphTraversal.EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  81. def minBy[B](f: (GraphTraversal.EdgeT) ⇒ B)(implicit cmp: Ordering[B]): GraphTraversal.EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  82. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  83. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. val n1: InnerEdgeTraverser
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to EdgeAssoc[InnerEdgeTraverser] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  86. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  87. def newBuilder: Builder[GraphTraversal.EdgeT, Traversable[GraphTraversal.EdgeT]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  88. def nodeParams: Traversable[NodeParam[N]]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  89. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. final def notify(): Unit
    Definition Classes
    AnyRef
  91. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  92. def par: ParIterable[GraphTraversal.EdgeT]
    Definition Classes
    Parallelizable
  93. def parCombiner: Combiner[GraphTraversal.EdgeT, ParIterable[GraphTraversal.EdgeT]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  94. def partition(p: (GraphTraversal.EdgeT) ⇒ Boolean): (Traversable[GraphTraversal.EdgeT], Traversable[GraphTraversal.EdgeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  95. lazy val partitioned: (Traversable[Param[N, E]], Traversable[Param[N, E]])
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  96. 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
  97. def product[B >: GraphTraversal.EdgeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def reduce[A1 >: GraphTraversal.EdgeT](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def reduceLeft[B >: GraphTraversal.EdgeT](op: (B, GraphTraversal.EdgeT) ⇒ B): B
    Definition Classes
    TraversableOnce
  100. def reduceLeftOption[B >: GraphTraversal.EdgeT](op: (B, GraphTraversal.EdgeT) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def reduceOption[A1 >: GraphTraversal.EdgeT](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def reduceRight[B >: GraphTraversal.EdgeT](op: (GraphTraversal.EdgeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def reduceRightOption[B >: GraphTraversal.EdgeT](op: (GraphTraversal.EdgeT, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def repr: Traversable[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  105. def reversed: List[GraphTraversal.EdgeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  106. def scan[B >: GraphTraversal.EdgeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[GraphTraversal.EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  107. def scanLeft[B, That](z: B)(op: (B, GraphTraversal.EdgeT) ⇒ B)(implicit bf: CanBuildFrom[Traversable[GraphTraversal.EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def scanRight[B, That](z: B)(op: (GraphTraversal.EdgeT, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[GraphTraversal.EdgeT], 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.

  109. def seq: Traversable[GraphTraversal.EdgeT]
    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  110. 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()
  111. 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()
  112. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  114. def slice(from: Int, until: Int): Traversable[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  115. def span(p: (GraphTraversal.EdgeT) ⇒ Boolean): (Traversable[GraphTraversal.EdgeT], Traversable[GraphTraversal.EdgeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  116. def splitAt(n: Int): (Traversable[GraphTraversal.EdgeT], Traversable[GraphTraversal.EdgeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  117. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  118. def sum[B >: GraphTraversal.EdgeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  120. def tail: Traversable[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  121. def tails: Iterator[Traversable[GraphTraversal.EdgeT]]
    Definition Classes
    TraversableLike
  122. def take(n: Int): Traversable[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  123. def takeWhile(p: (GraphTraversal.EdgeT) ⇒ Boolean): Traversable[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  124. def thisCollection: Traversable[GraphTraversal.EdgeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  125. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, GraphTraversal.EdgeT, Col[GraphTraversal.EdgeT]]): Col[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  126. def toArray[B >: GraphTraversal.EdgeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  127. def toBuffer[B >: GraphTraversal.EdgeT]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  128. def toCollection(repr: Traversable[GraphTraversal.EdgeT]): Traversable[GraphTraversal.EdgeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  129. 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
  130. def toInParams: Traversable[InParam[N, E]]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  131. def toIndexedSeq: IndexedSeq[GraphTraversal.EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. final def toInnerElemTraverser(root: NodeT): InnerElemTraverser
    Definition Classes
    FluentProperties
  133. def toIterable: Iterable[GraphTraversal.EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def toIterator: Iterator[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableOnce
  135. def toList: List[GraphTraversal.EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def toMap[T, U](implicit ev: <:<[GraphTraversal.EdgeT, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def toOuterEdges: Traversable[E[N]]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  138. def toOuterNodes: Traversable[N]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  139. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to CollectionsHaveToParArray[InnerEdgeTraverser, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (InnerEdgeTraverser) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  140. def toSeq: Seq[GraphTraversal.EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  141. def toSet[B >: GraphTraversal.EdgeT]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  142. def toStream: Stream[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableOnce
  143. def toString(): String
    Definition Classes
    TraversableLike → Any
  144. def toTraversable: Traversable[GraphTraversal.EdgeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  145. def toVector: Vector[GraphTraversal.EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  146. def transpose[B](implicit asTraversable: (GraphTraversal.EdgeT) ⇒ 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.

  147. def unzip[A1, A2](implicit asPair: (GraphTraversal.EdgeT) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
    Definition Classes
    GenericTraversableTemplate
  148. def unzip3[A1, A2, A3](implicit asTriple: (GraphTraversal.EdgeT) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
    Definition Classes
    GenericTraversableTemplate
  149. val value: InnerEdgeTraverser
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to OuterNode[InnerEdgeTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  150. def view(from: Int, until: Int): TraversableView[GraphTraversal.EdgeT, Traversable[GraphTraversal.EdgeT]]
    Definition Classes
    TraversableLike
  151. def view: TraversableView[GraphTraversal.EdgeT, Traversable[GraphTraversal.EdgeT]]
    Definition Classes
    TraversableLike
  152. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  153. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  154. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  155. 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
  156. def withFilter(p: (GraphTraversal.EdgeT) ⇒ Boolean): FilterMonadic[GraphTraversal.EdgeT, Traversable[GraphTraversal.EdgeT]]
    Definition Classes
    TraversableLike → FilterMonadic
  157. 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
  158. 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
  159. 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
  160. 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
  161. 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
  162. 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
  163. 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
  164. 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
  165. final def withSubgraph(nodes: GraphTraversal.NodeFilter = anyNode, edges: GraphTraversal.EdgeFilter = 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
  166. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to EdgeAssoc[InnerEdgeTraverser] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  167. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to EdgeAssoc[InnerEdgeTraverser] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  168. def [B](y: B): (InnerEdgeTraverser, B)
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to ArrowAssoc[InnerEdgeTraverser] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def filter(p: (GraphTraversal.EdgeT) ⇒ Boolean): TraversableOnce[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to MonadOps[GraphTraversal.EdgeT] 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:
    (innerEdgeTraverser: MonadOps[GraphTraversal.EdgeT]).filter(p)
    Definition Classes
    MonadOps
  2. def flatMap[B](f: (GraphTraversal.EdgeT) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to MonadOps[GraphTraversal.EdgeT] 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:
    (innerEdgeTraverser: MonadOps[GraphTraversal.EdgeT]).flatMap(f)
    Definition Classes
    MonadOps
  3. def flatten: Iterator[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to FlattenOps[NodeT] performed by method flattenTraversableOnce in scala.collection.TraversableOnce. This conversion will take place only if an implicit value of type (Iterable[NodeT]) ⇒ TraversableOnce[NodeT] is in scope.
    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: FlattenOps[NodeT]).flatten
    Definition Classes
    FlattenOps
  4. def map[B](f: (GraphTraversal.EdgeT) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to MonadOps[GraphTraversal.EdgeT] 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:
    (innerEdgeTraverser: MonadOps[GraphTraversal.EdgeT]).map(f)
    Definition Classes
    MonadOps
  5. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to OuterNode[InnerEdgeTraverser] 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:
    (innerEdgeTraverser: OuterNode[InnerEdgeTraverser]).stringPrefix
    Definition Classes
    NodeParam
  6. def toString(): String
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to OuterNode[InnerEdgeTraverser] 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:
    (innerEdgeTraverser: OuterNode[InnerEdgeTraverser]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  7. def withFilter(p: (GraphTraversal.EdgeT) ⇒ Boolean): Iterator[GraphTraversal.EdgeT]
    Implicit
    This member is added by an implicit conversion from InnerEdgeTraverser to MonadOps[GraphTraversal.EdgeT] 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:
    (innerEdgeTraverser: MonadOps[GraphTraversal.EdgeT]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from Properties

Inherited from SubgraphProperties

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from InnerEdgeTraverser to OuterNode[InnerEdgeTraverser]

Inherited by implicit conversion CollectionsHaveToParArray from InnerEdgeTraverser to CollectionsHaveToParArray[InnerEdgeTraverser, T]

Inherited by implicit conversion MonadOps from InnerEdgeTraverser to MonadOps[GraphTraversal.EdgeT]

Inherited by implicit conversion flattenTraversableOnce from InnerEdgeTraverser to FlattenOps[NodeT]

Inherited by implicit conversion EdgeAssoc from InnerEdgeTraverser to EdgeAssoc[InnerEdgeTraverser]

Inherited by implicit conversion graphParamsToPartition from InnerEdgeTraverser to Partitions[N, E]

Inherited by implicit conversion any2stringadd from InnerEdgeTraverser to any2stringadd[InnerEdgeTraverser]

Inherited by implicit conversion StringFormat from InnerEdgeTraverser to StringFormat[InnerEdgeTraverser]

Inherited by implicit conversion Ensuring from InnerEdgeTraverser to Ensuring[InnerEdgeTraverser]

Inherited by implicit conversion ArrowAssoc from InnerEdgeTraverser to ArrowAssoc[InnerEdgeTraverser]

Inherited by implicit conversion alternateImplicit from InnerEdgeTraverser to ForceImplicitAmbiguity

Ungrouped