scalax.collection.GraphTraversal
The number of layers of this topological order.
The number of layers of this topological order.
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
Creates a new flavor of this TopologicalOrder
or LayeredTopologicalOrder
that is traversable for its inner nodes zipped with their layers.
Creates a new flavor of this TopologicalOrder
or LayeredTopologicalOrder
that is traversable for its inner nodes zipped with their layers.
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
Creates a new flavor of this TopologicalOrder
or LayeredTopologicalOrder
with nodes ordered by newOrdering
within the layers.
Creates a new flavor of this TopologicalOrder
or LayeredTopologicalOrder
with nodes ordered by newOrdering
within the layers.
A layer ordering is also useful to ensure a stable topological order over graph instances.
(layeredTopologicalOrder: MonadOps[(Int, Iterable[A])]).filter(p)
(layeredTopologicalOrder: MonadOps[(Int, Iterable[A])]).flatMap(f)
(layeredTopologicalOrder: MonadOps[(Int, Iterable[A])]).map(f)
(layeredTopologicalOrder: StringAdd).self
(layeredTopologicalOrder: StringFormat).self
(layeredTopologicalOrder: OuterNode[LayeredTopologicalOrder[A]]).stringPrefix
(layeredTopologicalOrder: OuterNode[LayeredTopologicalOrder[A]]).toString()
(layeredTopologicalOrder: MonadOps[(Int, Iterable[A])]).withFilter(p)
(Since version 2.10.0) use fold instead
(layeredTopologicalOrder: ArrowAssoc[LayeredTopologicalOrder[A]]).x
(Since version 2.10.0) Use leftOfArrow
instead
(layeredTopologicalOrder: Ensuring[LayeredTopologicalOrder[A]]).x
(Since version 2.10.0) Use resultOfEnsuring
instead
Layers of a topological order of a graph or of an isolated graph component. The layers of a topological sort can roughly be defined as follows:
one of
NodeT
,N