final class LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]
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:
- layer 0 contains all nodes having no predecessors,
- layer n contains those nodes that have only predecessors in anchestor layers with at least one of them contained in layer n - 1
- A
one of
NodeT
,N
- Alphabetic
- By Inheritance
- LayeredTopologicalOrder
- AbstractTopologicalOrder
- AbstractTraversable
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
- by anyToNode
- by CollectionsHaveToParArray
- by MonadOps
- by EdgeAssoc
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- by alternateImplicit
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
LayeredTopologicalOrder(layers: Layers, toA: (NodeT) ⇒ A)(implicit layerOrdering: GraphTraversal.NodeOrdering = NodeOrdering.None)
- Attributes
- protected[scalax.collection]
Type Members
-
type
Self = Traversable[(Int, Iterable[A])]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
+(other: String): String
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to any2stringadd[LayeredTopologicalOrder[A]] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
-
def
++[B >: (Int, Iterable[A]), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: (Int, Iterable[A]), That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: (Int, Iterable[A]), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That
- Definition Classes
- TraversableLike
-
def
->[B](y: B): (LayeredTopologicalOrder[A], B)
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to ArrowAssoc[LayeredTopologicalOrder[A]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
-
def
/:[B](z: B)(op: (B, (Int, Iterable[A])) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: ((Int, Iterable[A]), B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, (Int, Iterable[A])) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
collect[B, That](pf: PartialFunction[(Int, Iterable[A]), B])(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[(Int, Iterable[A]), B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
companion: GenericCompanion[Traversable]
- Definition Classes
- Traversable → GenTraversable → GenericTraversableTemplate
-
def
copyToArray[B >: (Int, Iterable[A])](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (Int, Iterable[A])](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (Int, Iterable[A])](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: (Int, Iterable[A])](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: ((Int, Iterable[A])) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
drop(n: Int): Traversable[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
dropWhile(p: ((Int, Iterable[A])) ⇒ Boolean): Traversable[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
ensuring(cond: (LayeredTopologicalOrder[A]) ⇒ Boolean, msg: ⇒ Any): LayeredTopologicalOrder[A]
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to Ensuring[LayeredTopologicalOrder[A]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: (LayeredTopologicalOrder[A]) ⇒ Boolean): LayeredTopologicalOrder[A]
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to Ensuring[LayeredTopologicalOrder[A]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean, msg: ⇒ Any): LayeredTopologicalOrder[A]
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to Ensuring[LayeredTopologicalOrder[A]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean): LayeredTopologicalOrder[A]
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to Ensuring[LayeredTopologicalOrder[A]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(other: Any): Boolean
- Definition Classes
- AbstractTopologicalOrder → AnyRef → Any
-
def
exists(p: ((Int, Iterable[A])) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: ((Int, Iterable[A])) ⇒ Boolean): Traversable[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: ((Int, Iterable[A])) ⇒ Boolean): Traversable[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: ((Int, Iterable[A])) ⇒ Boolean): Option[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
flatMap[B, That](f: ((Int, Iterable[A])) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: ((Int, Iterable[A])) ⇒ GenTraversableOnce[B]): Traversable[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: (Int, Iterable[A])](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, (Int, Iterable[A])) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: ((Int, Iterable[A]), B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
forall(p: ((Int, Iterable[A])) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: ((Int, Iterable[A])) ⇒ U): Unit
- Definition Classes
- LayeredTopologicalOrder → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to StringFormat[LayeredTopologicalOrder[A]] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
def
genericBuilder[B]: Builder[B, Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
groupBy[K](f: ((Int, Iterable[A])) ⇒ K): Map[K, Traversable[(Int, Iterable[A])]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- Definition Classes
- AbstractTopologicalOrder → AnyRef → Any
-
def
head: (Int, Iterable[A])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
headOption: Option[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
init: Traversable[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[Traversable[(Int, Iterable[A])]]
- Definition Classes
- TraversableLike
-
def
isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to OuterNode[LayeredTopologicalOrder[A]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
-
def
isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to OuterNode[LayeredTopologicalOrder[A]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
isEmpty: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
isIn: Boolean
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to OuterNode[LayeredTopologicalOrder[A]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → Param
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isNode: Boolean
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to OuterNode[LayeredTopologicalOrder[A]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
isOut: Boolean
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to OuterNode[LayeredTopologicalOrder[A]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → Param
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
last: (Int, Iterable[A])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
implicit
val
layerOrdering: GraphTraversal.NodeOrdering
- Definition Classes
- LayeredTopologicalOrder → AbstractTopologicalOrder
-
val
layers: Layers
- Attributes
- protected
- Definition Classes
- LayeredTopologicalOrder → AbstractTopologicalOrder
-
def
map[B, That](f: ((Int, Iterable[A])) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
max[B >: (Int, Iterable[A])](implicit cmp: Ordering[B]): (Int, Iterable[A])
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: ((Int, Iterable[A])) ⇒ B)(implicit cmp: Ordering[B]): (Int, Iterable[A])
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: (Int, Iterable[A])](implicit cmp: Ordering[B]): (Int, Iterable[A])
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: ((Int, Iterable[A])) ⇒ B)(implicit cmp: Ordering[B]): (Int, Iterable[A])
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
val
n1: LayeredTopologicalOrder[A]
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to EdgeAssoc[LayeredTopologicalOrder[A]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]]
- Attributes
- protected[this]
- Definition Classes
- GenericTraversableTemplate → HasNewBuilder
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
nrOfLayers: Int
The number of layers of this topological order.
The number of layers of this topological order.
- Definition Classes
- AbstractTopologicalOrder
-
def
ordered(nodes: IndexedSeq[NodeT]): IndexedSeq[NodeT]
- Attributes
- protected
- Definition Classes
- AbstractTopologicalOrder
-
def
par: ParIterable[(Int, Iterable[A])]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[(Int, Iterable[A]), ParIterable[(Int, Iterable[A])]]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike → Parallelizable
-
def
partition(p: ((Int, Iterable[A])) ⇒ Boolean): (Traversable[(Int, Iterable[A])], Traversable[(Int, Iterable[A])])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
product[B >: (Int, Iterable[A])](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: (Int, Iterable[A])](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: (Int, Iterable[A])](op: (B, (Int, Iterable[A])) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: (Int, Iterable[A])](op: (B, (Int, Iterable[A])) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: (Int, Iterable[A])](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: (Int, Iterable[A])](op: ((Int, Iterable[A]), B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: (Int, Iterable[A])](op: ((Int, Iterable[A]), B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
repr: Traversable[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reversed: List[(Int, Iterable[A])]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
scan[B >: (Int, Iterable[A]), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, (Int, Iterable[A])) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: ((Int, Iterable[A]), B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], 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.
-
def
seq: Traversable[(Int, Iterable[A])]
- Definition Classes
- Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): Traversable[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
span(p: ((Int, Iterable[A])) ⇒ Boolean): (Traversable[(Int, Iterable[A])], Traversable[(Int, Iterable[A])])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (Traversable[(Int, Iterable[A])], Traversable[(Int, Iterable[A])])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
stringPrefix: String
- Definition Classes
- AbstractTopologicalOrder → TraversableLike → GenTraversableLike
-
def
sum[B >: (Int, Iterable[A])](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: Traversable[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[Traversable[(Int, Iterable[A])]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): Traversable[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
takeWhile(p: ((Int, Iterable[A])) ⇒ Boolean): Traversable[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
thisCollection: Traversable[(Int, Iterable[A])]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (Int, Iterable[A]), Col[(Int, Iterable[A])]]): Col[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
val
toA: (NodeT) ⇒ A
- Attributes
- protected
- Definition Classes
- LayeredTopologicalOrder → AbstractTopologicalOrder
-
def
toArray[B >: (Int, Iterable[A])](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[B >: (Int, Iterable[A])]: Buffer[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: Traversable[(Int, Iterable[A])]): Traversable[(Int, Iterable[A])]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
toIndexedSeq: IndexedSeq[(Int, Iterable[A])]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[(Int, Iterable[A])]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toLayered: LayeredTopologicalOrder[A]
Creates a new flavor of this
TopologicalOrder
orLayeredTopologicalOrder
that is traversable for its inner nodes zipped with their layers.Creates a new flavor of this
TopologicalOrder
orLayeredTopologicalOrder
that is traversable for its inner nodes zipped with their layers.- Definition Classes
- LayeredTopologicalOrder → AbstractTopologicalOrder
-
def
toList: List[(Int, Iterable[A])]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[(Int, Iterable[A]), (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
- def toOuter: LayeredTopologicalOrder[N]
-
def
toParArray: ParArray[T]
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to CollectionsHaveToParArray[LayeredTopologicalOrder[A], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (LayeredTopologicalOrder[A]) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
-
def
toSeq: Seq[(Int, Iterable[A])]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSet[B >: (Int, Iterable[A])]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- TraversableLike → Any
-
def
toTraversable: Traversable[(Int, Iterable[A])]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[(Int, Iterable[A])]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transpose[B](implicit asTraversable: ((Int, Iterable[A])) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transpose
throws anIllegalArgumentException
if collections are not uniformly sized.
-
def
unzip[A1, A2](implicit asPair: ((Int, Iterable[A])) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: ((Int, Iterable[A])) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
- Definition Classes
- GenericTraversableTemplate
-
val
value: LayeredTopologicalOrder[A]
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to OuterNode[LayeredTopologicalOrder[A]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- OuterNode → NodeParam
-
def
view(from: Int, until: Int): TraversableView[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]]
- Definition Classes
- TraversableLike
-
def
view: TraversableView[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]]
- Definition Classes
- TraversableLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
withFilter(p: ((Int, Iterable[A])) ⇒ Boolean): FilterMonadic[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
withLayerOrdering(newOrdering: GraphTraversal.NodeOrdering): LayeredTopologicalOrder[A]
Creates a new flavor of this
TopologicalOrder
orLayeredTopologicalOrder
with nodes ordered bynewOrdering
within the layers.Creates a new flavor of this
TopologicalOrder
orLayeredTopologicalOrder
with nodes ordered bynewOrdering
within the layers. A layer ordering is also useful to ensure a stable topological order over graph instances.- Definition Classes
- LayeredTopologicalOrder → AbstractTopologicalOrder
-
def
~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to EdgeAssoc[LayeredTopologicalOrder[A]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
-
def
~>[N >: N1](n2: N): DiEdge[N]
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to EdgeAssoc[LayeredTopologicalOrder[A]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
-
def
→[B](y: B): (LayeredTopologicalOrder[A], B)
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to ArrowAssoc[LayeredTopologicalOrder[A]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
Shadowed Implicit Value Members
-
def
filter(p: ((Int, Iterable[A])) ⇒ Boolean): TraversableOnce[(Int, Iterable[A])]
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to MonadOps[(Int, Iterable[A])] 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:(layeredTopologicalOrder: MonadOps[(Int, Iterable[A])]).filter(p)
- Definition Classes
- MonadOps
-
def
flatMap[B](f: ((Int, Iterable[A])) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to MonadOps[(Int, Iterable[A])] 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:(layeredTopologicalOrder: MonadOps[(Int, Iterable[A])]).flatMap(f)
- Definition Classes
- MonadOps
-
def
map[B](f: ((Int, Iterable[A])) ⇒ B): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to MonadOps[(Int, Iterable[A])] 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:(layeredTopologicalOrder: MonadOps[(Int, Iterable[A])]).map(f)
- Definition Classes
- MonadOps
-
def
stringPrefix: String
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to OuterNode[LayeredTopologicalOrder[A]] 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:(layeredTopologicalOrder: OuterNode[LayeredTopologicalOrder[A]]).stringPrefix
- Definition Classes
- NodeParam
-
def
toString(): String
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to OuterNode[LayeredTopologicalOrder[A]] 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:(layeredTopologicalOrder: OuterNode[LayeredTopologicalOrder[A]]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
-
def
withFilter(p: ((Int, Iterable[A])) ⇒ Boolean): Iterator[(Int, Iterable[A])]
- Implicit
- This member is added by an implicit conversion from LayeredTopologicalOrder[A] to MonadOps[(Int, Iterable[A])] 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:(layeredTopologicalOrder: MonadOps[(Int, Iterable[A])]).withFilter(p)
- Definition Classes
- MonadOps
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graph
mutable.Graph
and its inner nodes.GraphEdge
objectedge
packageGraphPredef
object andImplicits
object.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.