abstract class InnerEdgeTraverser extends TraverserMethods[EdgeT, InnerEdgeTraverser] with Traverser[EdgeT, InnerEdgeTraverser]
Controls the properties of inner-edge graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
- Alphabetic
- By Inheritance
- InnerEdgeTraverser
- Traverser
- ForeachBasedDetachingIterable
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- Properties
- SubgraphProperties
- TraverserMethods
- FluentProperties
- AnyRef
- Any
- by iterableOnceExtensionMethods
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new InnerEdgeTraverser()
Abstract Value Members
- abstract def findCycle[U](implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[Cycle]
Finds a cycle starting the search at
roottaking optional properties like subgraph restriction, ordering or maximum depth into account., if any.Finds a cycle starting the search at
roottaking optional properties like subgraph restriction, ordering or maximum depth into account., if any. The resulting cycle may start at any node connected withthisnode.- visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
- returns
A cycle or
Noneif either- there exists no cycle in the component depicting by
rootor - there exists a cycle in the component but due to withSubgraph settings this path was out of scope.
- there exists no cycle in the component depicting by
- Definition Classes
- TraverserMethods
- abstract def ordering: GraphTraversal.ElemOrdering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- Definition Classes
- Properties
- abstract def parameters: Parameters
The properties controlling subsequent traversals.
The properties controlling subsequent traversals.
- Definition Classes
- Properties
- abstract def partOfCycle[U](implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[Cycle]
Finds a cycle that contains
roottaking optional properties like subgraph restriction, ordering or maximum depth into account..Finds a cycle that contains
roottaking optional properties like subgraph restriction, ordering or maximum depth into account.. Irrespective of the current setting forkind,DepthFirstis used internally.- visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
- returns
A cycle containing
rootorNoneif either- there exists no cycle containing
rootor - there exists such a cycle but due to withSubgraph settings this path was out of scope.
- there exists no cycle containing
- Definition Classes
- TraverserMethods
- abstract def pathUntil[U](pred: GraphTraversal.NodePredicate)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[Path]
Finds a path from
rootto a successor ofrootfor whichpredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds a path from
rootto a successor ofrootfor whichpredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.rootitself 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
predorNoneif either- there is no node with
predor - there exists no path to such a node or
- there exists a path to such a node but due to withSubgraph settings this path was out of scope.
- there is no node with
- Definition Classes
- TraverserMethods
- abstract def root: NodeT
The node where subsequent graph traversals start.
The node where subsequent graph traversals start.
- Definition Classes
- Properties
- 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
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds the shortest path from
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method. The calculation is based on the weight of the edges on the path. Edges have a default weight of1Lthat can be overridden by custom edges. A weight function yielding any numeric type may also be passed toshortestPathTo.- 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
potentialSuccessororNoneif either- there exists no path to
potentialSuccessoror - there exists a path to
potentialSuccessorbut due to withSubgraph settings this path was out of scope.
- there exists no path to
- Definition Classes
- TraverserMethods
- 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
componentTraverserfor more control by means ofFluentProperties.- visitor
Function to be called for each inner node or inner edge visited during the search.
- Definition Classes
- TraverserMethods
- abstract def subgraphEdges: GraphTraversal.EdgePredicate
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- Definition Classes
- SubgraphProperties
- abstract def subgraphNodes: GraphTraversal.NodePredicate
Restricts subsequent graph traversals to visit only nodes holding this predicate.
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- Definition Classes
- SubgraphProperties
- abstract def topologicalSort[U](ignorePredecessors: Boolean = false)(implicit visitor: (GraphTraversal.InnerElem) => U = empty): TopologicalSort
Sorts the component designated by this node topologically.
Sorts the component designated by this node topologically. Only nodes connected with this node will be included in the resulting topological order. If the graph is known to be connected choose GraphTraversal#topologicalSort instead. See
componentTraverserfor more control by means ofFluentProperties.- ignorePredecessors
If
true, the topological sort will be partial in that it will only include successors ofroot.withSubgraphrestricts 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
- abstract def weakComponent[U](implicit visitor: (GraphTraversal.EdgeT) => U = empty): Component
Determines the weak component that contains this node.
Determines the weak component that contains this node. See
componentTraverserfor more control by means ofFluentProperties.- visitor
Function to be called for each inner node or inner edge visited during the search.
- Definition Classes
- TraverserMethods
Concrete Value Members
- final def ++[B >: GraphTraversal.EdgeT](suffix: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- final def addString(b: StringBuilder): b.type
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): b.type
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def collect[B](pf: PartialFunction[GraphTraversal.EdgeT, B]): Iterable[B]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
- final def collectFirst[B](pf: PartialFunction[GraphTraversal.EdgeT, B]): Option[B]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- def concat[B >: GraphTraversal.EdgeT](suffix: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- def copyToArray[B >: GraphTraversal.EdgeT](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: GraphTraversal.EdgeT](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: GraphTraversal.EdgeT](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: IterableOnce[B])(p: (GraphTraversal.EdgeT, B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- final def count(p: (GraphTraversal.EdgeT) => Boolean): Int
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- final def drop(n: Int): CC[GraphTraversal.EdgeT]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
- Annotations
- @inline()
- def dropRight(n: Int): Iterable[GraphTraversal.EdgeT]
- Definition Classes
- IterableOps
- final def dropWhile(p: (GraphTraversal.EdgeT) => Boolean): CC[GraphTraversal.EdgeT]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
- def empty: Iterable[GraphTraversal.EdgeT]
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def exists(p: (GraphTraversal.EdgeT) => Boolean): Boolean
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- final def filter(p: (GraphTraversal.EdgeT) => Boolean): CC[GraphTraversal.EdgeT]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
- Annotations
- @inline()
- final def filterNot(p: (GraphTraversal.EdgeT) => Boolean): CC[GraphTraversal.EdgeT]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
- Annotations
- @inline()
- final def find(p: (GraphTraversal.EdgeT) => Boolean): Option[GraphTraversal.EdgeT]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- final def findConnected[U](pred: GraphTraversal.NodePredicate)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[NodeT]
Finds a node connected with
rootby any number of edges with any direction for which the predicatepredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds a node connected with
rootby any number of edges with any direction for which the predicatepredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method. For directed or mixed graphs the node to be found is weakly connected with this node.rootitself does not count as a match. This is also true if it has a hook. If several connected nodes exist withpredthe 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
predorNoneif either- there is no node with
predor - there exists no connection to such a node or
- there exists a connection to such a node but due to withSubgraph settings this path was out of scope.
- there is no node with
- Definition Classes
- TraverserMethods
- final def findPredecessor[U](pred: GraphTraversal.NodePredicate)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[NodeT]
Finds a predecessor of
rootfor which the predicatepredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds a predecessor of
rootfor which the predicatepredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.rootitself 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
predorNoneif either- there is no node with
predor - there exists no path from such a node to this node or
- there exists a path from such a node to
rootbut due to withSubgraph settings this path was out of scope.
- there is no node with
- Definition Classes
- TraverserMethods
- final def findSuccessor[U](pred: GraphTraversal.NodePredicate)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[NodeT]
Finds a successor of
rootfor which the predicatepredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds a successor of
rootfor which the predicatepredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.rootitself does not count as a match. This is also true if it has a hook. If several successors holdingpredexist 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
predorNoneif either- there is no node with
predor - there exists no path to such a node or
- there exists a path to such a node but due to withSubgraph settings this path was out of scope.
- there is no node with
- Definition Classes
- TraverserMethods
- final def flatMap[B](f: (GraphTraversal.EdgeT) => IterableOnce[B]): Iterable[B]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: (GraphTraversal.EdgeT) => IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def fold[A1 >: GraphTraversal.EdgeT](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- final def foldLeft[B](z: B)(op: (B, GraphTraversal.EdgeT) => B): B
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- def foldRight[B](z: B)(op: (GraphTraversal.EdgeT, B) => B): B
- Definition Classes
- IterableOnceOps
- final def forall(p: (GraphTraversal.EdgeT) => Boolean): Boolean
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- final def foreach[U](f: (GraphTraversal.EdgeT) => U): Unit
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- def groupBy[K](f: (GraphTraversal.EdgeT) => K): Map[K, Iterable[GraphTraversal.EdgeT]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (GraphTraversal.EdgeT) => K)(f: (GraphTraversal.EdgeT) => B): Map[K, Iterable[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (GraphTraversal.EdgeT) => K)(f: (GraphTraversal.EdgeT) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[Iterable[GraphTraversal.EdgeT]]
- Definition Classes
- IterableOps
- final def hasPredecessor[U](potentialPredecessor: NodeT)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Boolean
Checks whether
potentialPredecessoris a predecessor ofrootconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Checks whether
potentialPredecessoris a predecessor ofrootconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method. Same asisSuccessorOf.- 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
trueif a path exists frompotentialPredecessortorootand it had not to be excluded due tosubgraphproperties.
- Definition Classes
- TraverserMethods
- Annotations
- @inline()
- final def hasSuccessor[U](potentialSuccessor: NodeT)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Boolean
Checks whether
potentialSuccessoris a successor of this node considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Checks whether
potentialSuccessoris a successor of this node considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method. Same asisPredecessorOf.- 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
trueif a path exists from this node topotentialSuccessorand it had not to be excluded due to asubgraph*restriction.
- Definition Classes
- TraverserMethods
- Annotations
- @inline()
- final def head: GraphTraversal.EdgeT
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps
- final def headOption: Option[GraphTraversal.EdgeT]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps
- def init: Iterable[GraphTraversal.EdgeT]
- Definition Classes
- IterableOps
- def inits: Iterator[Iterable[GraphTraversal.EdgeT]]
- Definition Classes
- IterableOps
- final def isConnectedWith[U](potentialConnected: NodeT)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Boolean
Checks whether
potentialConnectedis a node (not necessarily directly) connected withrootby 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 anywith*method.Checks whether
potentialConnectedis a node (not necessarily directly) connected withrootby 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 anywith*method. For directed or mixed graphs it is satisfactory thatpotentialConnectedis weakly connected withroot.- 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
trueif a path exists from this node topotentialConnectedand it had not to be excluded due tosubgraphproperties.
- Definition Classes
- TraverserMethods
- Annotations
- @inline()
- final def isEmpty: Boolean
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- final def isPredecessorOf[U](potentialSuccessor: NodeT)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Boolean
Same as
hasSuccessor.Same as
hasSuccessor.- Definition Classes
- TraverserMethods
- Annotations
- @inline()
- final def isSuccessorOf[U](potentialPredecessor: NodeT)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Boolean
Same as
hasPredecessor.Same as
hasPredecessor.- Definition Classes
- TraverserMethods
- Annotations
- @inline()
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- def iterableFactory: IterableFactory[Vector]
- Definition Classes
- ForeachBasedDetachingIterable → Iterable → IterableOps
- def iterator: Iterator[GraphTraversal.EdgeT]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnce
- def knownSize: Int
- Definition Classes
- IterableOnce
- def last: GraphTraversal.EdgeT
- Definition Classes
- IterableOps
- def lastOption: Option[GraphTraversal.EdgeT]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[GraphTraversal.EdgeT, B, InnerEdgeTraverser.this.type]
- Definition Classes
- Iterable
- final def map[B](f: (GraphTraversal.EdgeT) => B): Iterable[B]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
- final def max[B >: GraphTraversal.EdgeT](implicit ord: Ordering[B]): GraphTraversal.EdgeT
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- final def maxBy[B](f: (GraphTraversal.EdgeT) => B)(implicit cmp: Ordering[B]): GraphTraversal.EdgeT
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- final def maxByOption[B](f: (GraphTraversal.EdgeT) => B)(implicit cmp: Ordering[B]): Option[GraphTraversal.EdgeT]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- Annotations
- @inline()
- final def maxOption[B >: GraphTraversal.EdgeT](implicit ord: Ordering[B]): Option[GraphTraversal.EdgeT]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- Annotations
- @inline()
- 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
- final def min[B >: GraphTraversal.EdgeT](implicit ord: Ordering[B]): GraphTraversal.EdgeT
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- Annotations
- @inline()
- final def minBy[B](f: (GraphTraversal.EdgeT) => B)(implicit cmp: Ordering[B]): GraphTraversal.EdgeT
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- final def minByOption[B](f: (GraphTraversal.EdgeT) => B)(implicit cmp: Ordering[B]): Option[GraphTraversal.EdgeT]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- Annotations
- @inline()
- final def minOption[B >: GraphTraversal.EdgeT](implicit ord: Ordering[B]): Option[GraphTraversal.EdgeT]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- Annotations
- @inline()
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def partition(p: (GraphTraversal.EdgeT) => Boolean): (Iterable[GraphTraversal.EdgeT], Iterable[GraphTraversal.EdgeT])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: (GraphTraversal.EdgeT) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- final def pathTo[U](potentialSuccessor: NodeT)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[Path]
Finds a path from
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds a path from
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*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
potentialSuccessororNoneif either- there is no node with
predor - there exists no path to such a node
- there is no node with
- Definition Classes
- TraverserMethods
- final def product[B >: GraphTraversal.EdgeT](implicit num: Numeric[B]): B
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- Annotations
- @inline()
- final def reduce[B >: GraphTraversal.EdgeT](op: (B, B) => B): B
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- Annotations
- @inline()
- final def reduceLeft[B >: GraphTraversal.EdgeT](op: (B, GraphTraversal.EdgeT) => B): B
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- final def reduceLeftOption[B >: GraphTraversal.EdgeT](op: (B, GraphTraversal.EdgeT) => B): Option[B]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- Annotations
- @inline()
- final def reduceOption[B >: GraphTraversal.EdgeT](op: (B, B) => B): Option[B]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- Annotations
- @inline()
- def reduceRight[B >: GraphTraversal.EdgeT](op: (GraphTraversal.EdgeT, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: GraphTraversal.EdgeT](op: (GraphTraversal.EdgeT, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def scan[B >: GraphTraversal.EdgeT](z: B)(op: (B, B) => B): Iterable[B]
- Definition Classes
- IterableOps
- final def scanLeft[B](z: B)(op: (B, GraphTraversal.EdgeT) => B): CC[B]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (GraphTraversal.EdgeT, B) => B): Iterable[B]
- Definition Classes
- IterableOps
- final def shortestPathTo[T](potentialSuccessor: NodeT, weight: (GraphTraversal.EdgeT) => T)(implicit arg0: Numeric[T]): Option[Path]
Finds the shortest path from
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds the shortest path from
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method. The calculation is based on the weight of the edges on the path. Edges have a default weight of1Lthat can be overridden by custom edges. A weight function yielding any numeric type may also be passed toshortestPathTo.- 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
potentialSuccessororNoneif either- there exists no path to
potentialSuccessoror - there exists a path to
potentialSuccessorbut due to withSubgraph settings this path was out of scope.
- there exists no path to
- Definition Classes
- TraverserMethods
- Annotations
- @inline()
- final def shortestPathTo[U](potentialSuccessor: NodeT)(implicit visitor: (GraphTraversal.EdgeT) => U = empty): Option[Path]
Finds the shortest path from
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds the shortest path from
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method. The calculation is based on the weight of the edges on the path. Edges have a default weight of1Lthat can be overridden by custom edges. A weight function yielding any numeric type may also be passed toshortestPathTo.- 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
potentialSuccessororNoneif either- there exists no path to
potentialSuccessoror - there exists a path to
potentialSuccessorbut due to withSubgraph settings this path was out of scope.
- there exists no path to
- Definition Classes
- TraverserMethods
- Annotations
- @inline()
- final def size: Int
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- def sizeCompare(that: Iterable[_]): Int
- Definition Classes
- IterableOps
- def sizeCompare(otherSize: Int): Int
- Definition Classes
- IterableOps
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- final def slice(from: Int, until: Int): CC[GraphTraversal.EdgeT]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): Iterator[Iterable[GraphTraversal.EdgeT]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[Iterable[GraphTraversal.EdgeT]]
- Definition Classes
- IterableOps
- final def span(p: (GraphTraversal.EdgeT) => Boolean): (CC[GraphTraversal.EdgeT], CC[GraphTraversal.EdgeT])
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
- final def splitAt(n: Int): (CC[GraphTraversal.EdgeT], CC[GraphTraversal.EdgeT])
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[GraphTraversal.EdgeT, S]): S
- Definition Classes
- IterableOnce
- final def sum[B >: GraphTraversal.EdgeT](implicit num: Numeric[B]): B
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- Annotations
- @inline()
- def tail: Iterable[GraphTraversal.EdgeT]
- Definition Classes
- IterableOps
- def tails: Iterator[Iterable[GraphTraversal.EdgeT]]
- Definition Classes
- IterableOps
- final def take(n: Int): Iterable[GraphTraversal.EdgeT]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
- def takeRight(n: Int): Iterable[GraphTraversal.EdgeT]
- Definition Classes
- IterableOps
- final def takeWhile(p: (GraphTraversal.EdgeT) => Boolean): CC[GraphTraversal.EdgeT]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
- def tapEach[U](f: (GraphTraversal.EdgeT) => U): Iterable[GraphTraversal.EdgeT]
- Definition Classes
- IterableOps → IterableOnceOps
- final def to[CC[N, E <: Edge[N]] <: AnyGraph[N, E] with GraphLike[N, E, CC]](factory: GenericGraphCoreFactory[CC]): CC[N, E]
Completes a traversal and creates a new connected graph populated with the elements visited.
Completes a traversal and creates a new connected graph populated with the elements visited.
- Definition Classes
- Traverser
- final def to[C1](factory: Factory[GraphTraversal.EdgeT, C1]): C1
- Definition Classes
- ForeachBasedDetachingIterable → IterableOnceOps
- def toArray[B >: GraphTraversal.EdgeT](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: GraphTraversal.EdgeT]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[GraphTraversal.EdgeT]
- Definition Classes
- IterableOnceOps
- final def toInnerElemTraverser(root: NodeT): InnerElemTraverser
- Definition Classes
- FluentProperties
- def toList: List[GraphTraversal.EdgeT]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[GraphTraversal.EdgeT, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[GraphTraversal.EdgeT]
- Definition Classes
- IterableOnceOps
- def toSet[B >: GraphTraversal.EdgeT]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
- Definition Classes
- Iterable → AnyRef → Any
- def toVector: Vector[GraphTraversal.EdgeT]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (GraphTraversal.EdgeT) => Iterable[B]): Iterable[Iterable[B]]
- Definition Classes
- IterableOps
- def unzip[A1, A2](implicit asPair: (GraphTraversal.EdgeT) => (A1, A2)): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (GraphTraversal.EdgeT) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
- Definition Classes
- IterableOps
- def view: View[GraphTraversal.EdgeT]
- Definition Classes
- IterableOps
- final def withDirection(direction: Direction): InnerEdgeTraverser
Creates a new FluentProperties based on
thisexcept for an updateddirection.Creates a new FluentProperties based on
thisexcept for an updateddirection. Note that methods returning a Cycle or Path accept onlySuccessors.- Definition Classes
- FluentProperties
- def withFilter(p: (GraphTraversal.EdgeT) => Boolean): WithFilter[GraphTraversal.EdgeT, Iterable]
- Definition Classes
- IterableOps
- final def withKind(kind: Kind): InnerEdgeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedkind.Creates a new FluentProperties based on
thisexcept for an updatedkind.- Definition Classes
- FluentProperties
- final def withMaxDepth(maxDepth: Int): InnerEdgeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedmaxDepth.Creates a new FluentProperties based on
thisexcept for an updatedmaxDepth.- Definition Classes
- FluentProperties
- final def withMaxWeight(max: Long): InnerEdgeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedmaxWeighthaving the givenmaxand the default weight function returningedge.weight.Creates a new FluentProperties based on
thisexcept for an updatedmaxWeighthaving the givenmaxand the default weight function returningedge.weight.- Definition Classes
- FluentProperties
- final def withMaxWeight[W](max: W, edgeWeight: (GraphTraversal.EdgeT) => W)(implicit arg0: Numeric[W]): InnerEdgeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedmaxWeighthaving the givenmaxvalue and the given weight function.Creates a new FluentProperties based on
thisexcept for an updatedmaxWeighthaving the givenmaxvalue and the given weight function.- Definition Classes
- FluentProperties
- def withMaxWeight(maxWeight: Option[Weight]): InnerEdgeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedmaxWeight.Creates a new FluentProperties based on
thisexcept for an updatedmaxWeight.- Definition Classes
- FluentProperties
- final def withOrdering(ordering: GraphTraversal.ElemOrdering): InnerEdgeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedordering.Creates a new FluentProperties based on
thisexcept for an updatedordering.- Definition Classes
- FluentProperties
- final def withParameters(parameters: Parameters): InnerEdgeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedparameters.Creates a new FluentProperties based on
thisexcept for an updatedparameters.- Definition Classes
- FluentProperties
- final def withRoot(root: NodeT): InnerEdgeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedroot.Creates a new FluentProperties based on
thisexcept for an updatedroot.- Definition Classes
- TraverserMethods
- final def withSubgraph(nodes: GraphTraversal.NodePredicate = anyNode, edges: GraphTraversal.EdgePredicate = anyEdge): InnerEdgeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedsubgraphNodesand/orsubgraphEdges.Creates a new FluentProperties based on
thisexcept for an updatedsubgraphNodesand/orsubgraphEdges.- Definition Classes
- FluentProperties
- def zip[B](that: IterableOnce[B]): Iterable[(GraphTraversal.EdgeT, B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: GraphTraversal.EdgeT, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
- Definition Classes
- IterableOps
- final def zipWithIndex: CC[(GraphTraversal.EdgeT, Int)]
- Definition Classes
- ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
Deprecated Value Members
- def ++:[B >: GraphTraversal.EdgeT](that: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
- def /:[B](z: B)(op: (B, GraphTraversal.EdgeT) => B): B
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT])./:(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
- final def /:[B](z: B)(op: (B, GraphTraversal.EdgeT) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- def :\[B](z: B)(op: (GraphTraversal.EdgeT, B) => B): B
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).:\(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- final def :\[B](z: B)(op: (GraphTraversal.EdgeT, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: => B)(seqop: (B, GraphTraversal.EdgeT) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregateis not relevant for sequential collections. UsefoldLeft(z)(seqop)instead.
- def collectFirst[B](f: PartialFunction[GraphTraversal.EdgeT, B]): Option[B]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).collectFirst(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.collectFirst(...) instead
- def companion: IterableFactory[Iterable]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding() @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- def copyToBuffer(dest: Buffer[GraphTraversal.EdgeT]): Unit
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).copyToBuffer(dest)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.copyToBuffer(...) instead
- final def copyToBuffer[B >: GraphTraversal.EdgeT](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= collinstead
- def count(f: (GraphTraversal.EdgeT) => Boolean): Int
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).count(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.count(...) instead
- def exists(f: (GraphTraversal.EdgeT) => Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).exists(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.exists(...) instead
- def filter(f: (GraphTraversal.EdgeT) => Boolean): Iterator[GraphTraversal.EdgeT]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).filter(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.filter(...) instead
- def find(p: (GraphTraversal.EdgeT) => Boolean): Option[GraphTraversal.EdgeT]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).find(p)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.find instead
- def flatMap[B](f: (GraphTraversal.EdgeT) => IterableOnce[B]): IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).flatMap(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable
- def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).fold(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.fold instead
- def foldLeft[B](z: B)(op: (B, GraphTraversal.EdgeT) => B): B
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).foldLeft(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
- def foldRight[B](z: B)(op: (GraphTraversal.EdgeT, B) => B): B
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).foldRight(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- def forall(f: (GraphTraversal.EdgeT) => Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).forall(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.forall(...) instead
- def foreach[U](f: (GraphTraversal.EdgeT) => U): Unit
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).foreach(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foreach(...) instead
- def hasDefiniteSize: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
- def isEmpty: Boolean
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).isEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.isEmpty instead
- def map[B](f: (GraphTraversal.EdgeT) => B): IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).map(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable
- def max(implicit ord: Ordering[GraphTraversal.EdgeT]): GraphTraversal.EdgeT
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).max(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.max instead
- def maxBy[B](f: (GraphTraversal.EdgeT) => B)(implicit cmp: Ordering[B]): GraphTraversal.EdgeT
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).maxBy(f)(cmp)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.maxBy(...) instead
- def min(implicit ord: Ordering[GraphTraversal.EdgeT]): GraphTraversal.EdgeT
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).min(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.min instead
- def minBy[B](f: (GraphTraversal.EdgeT) => B)(implicit cmp: Ordering[B]): GraphTraversal.EdgeT
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).minBy(f)(cmp)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.minBy(...) instead
- def mkString: String
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).mkString
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def mkString(sep: String): String
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).mkString(sep)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def mkString(start: String, sep: String, end: String): String
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).mkString(start, sep, end)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def nonEmpty: Boolean
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).nonEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.nonEmpty instead
- def product(implicit num: Numeric[GraphTraversal.EdgeT]): GraphTraversal.EdgeT
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).product(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.product instead
- def reduce(f: (GraphTraversal.EdgeT, GraphTraversal.EdgeT) => GraphTraversal.EdgeT): GraphTraversal.EdgeT
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).reduce(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduce(...) instead
- def reduceLeft(f: (GraphTraversal.EdgeT, GraphTraversal.EdgeT) => GraphTraversal.EdgeT): GraphTraversal.EdgeT
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).reduceLeft(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeft(...) instead
- def reduceLeftOption(f: (GraphTraversal.EdgeT, GraphTraversal.EdgeT) => GraphTraversal.EdgeT): Option[GraphTraversal.EdgeT]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).reduceLeftOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead
- def reduceOption(f: (GraphTraversal.EdgeT, GraphTraversal.EdgeT) => GraphTraversal.EdgeT): Option[GraphTraversal.EdgeT]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).reduceOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceOption(...) instead
- def reduceRight(f: (GraphTraversal.EdgeT, GraphTraversal.EdgeT) => GraphTraversal.EdgeT): GraphTraversal.EdgeT
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).reduceRight(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRight(...) instead
- def reduceRightOption(f: (GraphTraversal.EdgeT, GraphTraversal.EdgeT) => GraphTraversal.EdgeT): Option[GraphTraversal.EdgeT]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).reduceRightOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRightOption(...) instead
- final def repr: Iterable[GraphTraversal.EdgeT]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
- def sameElements[B >: A](that: IterableOnce[B]): Boolean
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.sameElements instead
- def seq: InnerEdgeTraverser.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- def size: Int
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).size
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.size instead
- def sum(implicit num: Numeric[GraphTraversal.EdgeT]): GraphTraversal.EdgeT
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).sum(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.sum instead
- def to[C1](factory: Factory[GraphTraversal.EdgeT, C1]): C1
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).to(factory)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(factory) instead
- def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toArray(arg0)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.toArray
- def toBuffer[B >: A]: Buffer[B]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toBuffer
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead
- def toIndexedSeq: IndexedSeq[GraphTraversal.EdgeT]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toIndexedSeq
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.toIndexedSeq instead
- final def toIterable: Iterable[GraphTraversal.EdgeT]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toIterable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
- final def toIterable: InnerEdgeTraverser.this.type
- Definition Classes
- Iterable → IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to
toListortoSeq, but it doesn't copy non-immutable collections
- def toIterator: Iterator[GraphTraversal.EdgeT]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toIterator
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead
- final def toIterator: Iterator[GraphTraversal.EdgeT]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- def toList: List[GraphTraversal.EdgeT]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toList
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(List) instead
- def toMap[K, V](implicit ev: <:<[GraphTraversal.EdgeT, (K, V)]): Map[K, V]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toMap(ev)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(Map) instead
- def toSeq: Seq[GraphTraversal.EdgeT]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toSeq
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Seq) instead
- def toSet[B >: A]: Set[B]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toSet
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Set) instead
- def toStream: Stream[GraphTraversal.EdgeT]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toStream
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(LazyList) instead
- final def toStream: Stream[GraphTraversal.EdgeT]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[GraphTraversal.EdgeT]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toTraversable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
- final def toTraversable: Traversable[GraphTraversal.EdgeT]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to
toListortoSeq, but it doesn't copy non-immutable collections
- def toVector: Vector[GraphTraversal.EdgeT]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).toVector
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Vector) instead
- def view(from: Int, until: Int): View[GraphTraversal.EdgeT]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)
- def withFilter(f: (GraphTraversal.EdgeT) => Boolean): Iterator[GraphTraversal.EdgeT]
- Implicit
- This member is added by an implicit conversion from InnerEdgeTraverser toIterableOnceExtensionMethods[GraphTraversal.EdgeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(innerEdgeTraverser: IterableOnceExtensionMethods[GraphTraversal.EdgeT]).withFilter(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.withFilter(...) instead
Welcome to the Graph for Scala API reference. Some suggested entry points:
AnyGraphimmutable.Graphand its inner nodesmutable.Graphand its inner nodes.edgespackage and its subpackageshyperedgespackage and its subpackages.labeled edgespackagemultilabeled edgespackagelabeled hyperedgespackagemultilabeled hyperedgespackageordered labeled hyperedgespackageordered multilabeled hyperedgesobjectgenericpackage.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.