scalax.collection.GraphTraversalImpl
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.
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.
See GraphTraversal#topologicalSort.
See GraphTraversal#topologicalSortByComponent.
(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.this)#Component]).filter(p)
(componentTraverser: MonadOps[(GraphTraversalImpl.this)#Component]).flatMap(f)
(componentTraverser: MonadOps[(GraphTraversalImpl.this)#Component]).map(f)
(componentTraverser: StringAdd).self
(componentTraverser: StringFormat).self
(componentTraverser: OuterNode[(GraphTraversalImpl.this)#ComponentTraverser]).stringPrefix
(componentTraverser: OuterNode[(GraphTraversalImpl.this)#ComponentTraverser]).toString()
(componentTraverser: MonadOps[(GraphTraversalImpl.this)#Component]).withFilter(p)
(Since version 2.10.0) use fold instead
(componentTraverser: ArrowAssoc[(GraphTraversalImpl.this)#ComponentTraverser]).x
(Since version 2.10.0) Use leftOfArrow
instead
(componentTraverser: Ensuring[(GraphTraversalImpl.this)#ComponentTraverser]).x
(Since version 2.10.0) Use resultOfEnsuring
instead
Controls the properties of graph traversals with no specific root. Provides methods to refine the properties and to invoke multiple traversals to span all graph components.