scalax.collection.GraphTraversalImpl
If a NodeOrdering or EdgeOrdering different from noOrdering is supplied
neighbor nodes will be sorted during the traversal.
If a NodeOrdering or EdgeOrdering different from noOrdering is supplied
neighbor nodes will be sorted during the traversal. Thus it is guaranteed that
the smaller an element's ranking the sooner it will be processed. In case of
EdgeOrdering it is guaranteed that the smaller an edge's ranking the sooner
its relevant end(s) will be processed.
The properties controlling subsequent traversals.
The properties controlling subsequent traversals.
The node where subsequent graph traversals start.
The node where subsequent graph traversals start.
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
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.
Restricts subsequent graph traversals to visit only nodes holding this predicate.
Restricts subsequent graph traversals to visit only nodes holding this predicate.
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
Creates a new FluentProperties based on this except for an updated direction.
Creates a new FluentProperties based on this except for an updated direction.
Creates a new FluentProperties based on this except for an updated kind.
Creates a new FluentProperties based on this except for an updated kind.
Creates a new FluentProperties based on this except for an updated maxDepth.
Creates a new FluentProperties based on this except for an updated maxDepth.
Creates a new FluentProperties based on this except for an updated ordering.
Creates a new FluentProperties based on this except for an updated ordering.
Creates a new FluentProperties based on this except for an updated parameters.
Creates a new FluentProperties based on this except for an updated parameters.
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.
(componentTraverser: MonadOps[GraphTraversalImpl.Component]).filter(p)
(componentTraverser: MonadOps[GraphTraversalImpl.Component]).flatMap(f)
(componentTraverser: MonadOps[GraphTraversalImpl.Component]).map(f)
(componentTraverser: StringAdd).self
(componentTraverser: StringFormat).self
(componentTraverser: OuterNode[ComponentTraverser]).stringPrefix
(componentTraverser: OuterNode[ComponentTraverser]).toString()
(componentTraverser: MonadOps[GraphTraversalImpl.Component]).withFilter(p)
(Since version 2.10.0) use fold instead
(componentTraverser: ArrowAssoc[ComponentTraverser]).x
(Since version 2.10.0) Use leftOfArrow instead
(componentTraverser: Ensuring[ComponentTraverser]).x
(Since version 2.10.0) Use resultOfEnsuring instead
Controls the properties of consecutive graph traversals with no specific root. Provides methods to refine the properties and to invoke multiple traversals to cover all graph components.