Class

scalax.collection.GraphTraversal

LayeredTopologicalOrder

Related Doc: package GraphTraversal

Permalink

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:

  1. layer 0 contains all nodes having no predecessors,
  2. 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

Linear Supertypes
AbstractTopologicalOrder[A, (Int, Iterable[A])], AbstractTraversable[(Int, Iterable[A])], Traversable[(Int, Iterable[A])], GenTraversable[(Int, Iterable[A])], GenericTraversableTemplate[(Int, Iterable[A]), Traversable], TraversableLike[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]], GenTraversableLike[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]], Parallelizable[(Int, Iterable[A]), ParIterable[(Int, Iterable[A])]], TraversableOnce[(Int, Iterable[A])], GenTraversableOnce[(Int, Iterable[A])], FilterMonadic[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]], HasNewBuilder[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]], AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. LayeredTopologicalOrder
  2. AbstractTopologicalOrder
  3. AbstractTraversable
  4. Traversable
  5. GenTraversable
  6. GenericTraversableTemplate
  7. TraversableLike
  8. GenTraversableLike
  9. Parallelizable
  10. TraversableOnce
  11. GenTraversableOnce
  12. FilterMonadic
  13. HasNewBuilder
  14. AnyRef
  15. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by EdgeAssoc
  5. by any2stringadd
  6. by StringFormat
  7. by Ensuring
  8. by ArrowAssoc
  9. by alternateImplicit
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LayeredTopologicalOrder(layers: Layers, toA: (NodeT) ⇒ A)(implicit layerOrdering: GraphTraversal.NodeOrdering = NodeOrdering.None)

    Permalink

    Attributes
    protected[scalax.collection]

Type Members

  1. type Self = Traversable[(Int, Iterable[A])]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  2. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def +(other: String): String

    Permalink
    Implicit information
    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

  4. def ++[B >: (Int, Iterable[A]), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  5. def ++:[B >: (Int, Iterable[A]), That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That

    Permalink
    Definition Classes
    TraversableLike

  6. def ++:[B >: (Int, Iterable[A]), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That

    Permalink
    Definition Classes
    TraversableLike

  7. def ->[B](y: B): (LayeredTopologicalOrder[A], B)

    Permalink
    Implicit information
    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()

  8. def /:[B](z: B)(op: (B, (Int, Iterable[A])) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  9. def :\[B](z: B)(op: ((Int, Iterable[A]), B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  10. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  11. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  12. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  14. def aggregate[B](z: ⇒ B)(seqop: (B, (Int, Iterable[A])) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  15. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  16. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  17. def collect[B, That](pf: PartialFunction[(Int, Iterable[A]), B])(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  18. def collectFirst[B](pf: PartialFunction[(Int, Iterable[A]), B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce

  19. def companion: GenericCompanion[Traversable]

    Permalink
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate

  20. def copyToArray[B >: (Int, Iterable[A])](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  21. def copyToArray[B >: (Int, Iterable[A])](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  22. def copyToArray[B >: (Int, Iterable[A])](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  23. def copyToBuffer[B >: (Int, Iterable[A])](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce

  24. def count(p: ((Int, Iterable[A])) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  25. def drop(n: Int): Traversable[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  26. def dropWhile(p: ((Int, Iterable[A])) ⇒ Boolean): Traversable[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  27. def ensuring(cond: (LayeredTopologicalOrder[A]) ⇒ Boolean, msg: ⇒ Any): LayeredTopologicalOrder[A]

    Permalink
    Implicit information
    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

  28. def ensuring(cond: (LayeredTopologicalOrder[A]) ⇒ Boolean): LayeredTopologicalOrder[A]

    Permalink
    Implicit information
    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

  29. def ensuring(cond: Boolean, msg: ⇒ Any): LayeredTopologicalOrder[A]

    Permalink
    Implicit information
    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

  30. def ensuring(cond: Boolean): LayeredTopologicalOrder[A]

    Permalink
    Implicit information
    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

  31. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  32. def equals(other: Any): Boolean

    Permalink
    Definition Classes
    AbstractTopologicalOrder → AnyRef → Any

  33. def exists(p: ((Int, Iterable[A])) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  34. def filter(p: ((Int, Iterable[A])) ⇒ Boolean): Traversable[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  35. def filterNot(p: ((Int, Iterable[A])) ⇒ Boolean): Traversable[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  36. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  37. def find(p: ((Int, Iterable[A])) ⇒ Boolean): Option[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  38. def flatMap[B, That](f: ((Int, Iterable[A])) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  39. def flatten[B](implicit asTraversable: ((Int, Iterable[A])) ⇒ GenTraversableOnce[B]): Traversable[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate

  40. def fold[A1 >: (Int, Iterable[A])](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  41. def foldLeft[B](z: B)(op: (B, (Int, Iterable[A])) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  42. def foldRight[B](z: B)(op: ((Int, Iterable[A]), B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  43. def forall(p: ((Int, Iterable[A])) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  44. def foreach[U](f: ((Int, Iterable[A])) ⇒ U): Unit

    Permalink
    Definition Classes
    LayeredTopologicalOrder → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

  45. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    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()

  46. def genericBuilder[B]: Builder[B, Traversable[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate

  47. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  48. def groupBy[K](f: ((Int, Iterable[A])) ⇒ K): Map[K, Traversable[(Int, Iterable[A])]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  49. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  50. def hashCode(): Int

    Permalink
    Definition Classes
    AbstractTopologicalOrder → AnyRef → Any

  51. def head: (Int, Iterable[A])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  52. def headOption: Option[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  53. def init: Traversable[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  54. def inits: Iterator[Traversable[(Int, Iterable[A])]]

    Permalink
    Definition Classes
    TraversableLike

  55. def isDefined: Boolean

    Permalink
    Implicit information
    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

  56. def isEdge: Boolean

    Permalink
    Implicit information
    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

  57. def isEmpty: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  58. def isIn: Boolean

    Permalink
    Implicit information
    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

  59. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  60. def isNode: Boolean

    Permalink
    Implicit information
    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

  61. def isOut: Boolean

    Permalink
    Implicit information
    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

  62. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  63. def last: (Int, Iterable[A])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  64. def lastOption: Option[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  65. implicit val layerOrdering: GraphTraversal.NodeOrdering

    Permalink
    Definition Classes
    LayeredTopologicalOrder → AbstractTopologicalOrder

  66. val layers: Layers

    Permalink
    Attributes
    protected
    Definition Classes
    LayeredTopologicalOrder → AbstractTopologicalOrder

  67. def map[B, That](f: ((Int, Iterable[A])) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  68. def max[B >: (Int, Iterable[A])](implicit cmp: Ordering[B]): (Int, Iterable[A])

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  69. def maxBy[B](f: ((Int, Iterable[A])) ⇒ B)(implicit cmp: Ordering[B]): (Int, Iterable[A])

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  70. def min[B >: (Int, Iterable[A])](implicit cmp: Ordering[B]): (Int, Iterable[A])

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  71. def minBy[B](f: ((Int, Iterable[A])) ⇒ B)(implicit cmp: Ordering[B]): (Int, Iterable[A])

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  72. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  73. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  74. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  75. val n1: LayeredTopologicalOrder[A]

    Permalink
    Implicit information
    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

  76. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  77. def newBuilder: Builder[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder

  78. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  79. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  80. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  81. def nrOfLayers: Int

    Permalink

    The number of layers of this topological order.

    The number of layers of this topological order.

    Definition Classes
    AbstractTopologicalOrder

  82. def ordered(nodes: IndexedSeq[NodeT]): IndexedSeq[NodeT]

    Permalink
    Attributes
    protected
    Definition Classes
    AbstractTopologicalOrder

  83. def par: ParIterable[(Int, Iterable[A])]

    Permalink
    Definition Classes
    Parallelizable

  84. def parCombiner: Combiner[(Int, Iterable[A]), ParIterable[(Int, Iterable[A])]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable

  85. def partition(p: ((Int, Iterable[A])) ⇒ Boolean): (Traversable[(Int, Iterable[A])], Traversable[(Int, Iterable[A])])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  86. def product[B >: (Int, Iterable[A])](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  87. def reduce[A1 >: (Int, Iterable[A])](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  88. def reduceLeft[B >: (Int, Iterable[A])](op: (B, (Int, Iterable[A])) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce

  89. def reduceLeftOption[B >: (Int, Iterable[A])](op: (B, (Int, Iterable[A])) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  90. def reduceOption[A1 >: (Int, Iterable[A])](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  91. def reduceRight[B >: (Int, Iterable[A])](op: ((Int, Iterable[A]), B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  92. def reduceRightOption[B >: (Int, Iterable[A])](op: ((Int, Iterable[A]), B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  93. def repr: Traversable[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  94. def reversed: List[(Int, Iterable[A])]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  95. def scan[B >: (Int, Iterable[A]), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  96. def scanLeft[B, That](z: B)(op: (B, (Int, Iterable[A])) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  97. def scanRight[B, That](z: B)(op: ((Int, Iterable[A]), B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(Int, Iterable[A])], B, That]): That

    Permalink
    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.

  98. def seq: Traversable[(Int, Iterable[A])]

    Permalink
    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

  99. def size: Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  100. def slice(from: Int, until: Int): Traversable[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  101. def span(p: ((Int, Iterable[A])) ⇒ Boolean): (Traversable[(Int, Iterable[A])], Traversable[(Int, Iterable[A])])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  102. def splitAt(n: Int): (Traversable[(Int, Iterable[A])], Traversable[(Int, Iterable[A])])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  103. def stringPrefix: String

    Permalink
    Definition Classes
    AbstractTopologicalOrder → TraversableLike → GenTraversableLike

  104. def sum[B >: (Int, Iterable[A])](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  105. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  106. def tail: Traversable[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  107. def tails: Iterator[Traversable[(Int, Iterable[A])]]

    Permalink
    Definition Classes
    TraversableLike

  108. def take(n: Int): Traversable[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  109. def takeWhile(p: ((Int, Iterable[A])) ⇒ Boolean): Traversable[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  110. def thisCollection: Traversable[(Int, Iterable[A])]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  111. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (Int, Iterable[A]), Col[(Int, Iterable[A])]]): Col[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  112. val toA: (NodeT) ⇒ A

    Permalink
    Attributes
    protected
    Definition Classes
    LayeredTopologicalOrder → AbstractTopologicalOrder

  113. def toArray[B >: (Int, Iterable[A])](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  114. def toBuffer[B >: (Int, Iterable[A])]: Buffer[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  115. def toCollection(repr: Traversable[(Int, Iterable[A])]): Traversable[(Int, Iterable[A])]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  116. def toIndexedSeq: IndexedSeq[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  117. def toIterable: Iterable[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  118. def toIterator: Iterator[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableOnce

  119. def toLayered: LayeredTopologicalOrder[A]

    Permalink

    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.

    Definition Classes
    LayeredTopologicalOrder → AbstractTopologicalOrder

  120. def toList: List[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  121. def toMap[T, U](implicit ev: <:<[(Int, Iterable[A]), (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  122. def toOuter: LayeredTopologicalOrder[N]

    Permalink

  123. def toParArray: ParArray[T]

    Permalink
    Implicit information
    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

  124. def toSeq: Seq[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  125. def toSet[B >: (Int, Iterable[A])]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  126. def toStream: Stream[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableOnce

  127. def toString(): String

    Permalink
    Definition Classes
    TraversableLike → Any

  128. def toTraversable: Traversable[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  129. def toVector: Vector[(Int, Iterable[A])]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  130. def transpose[B](implicit asTraversable: ((Int, Iterable[A])) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  131. def unzip[A1, A2](implicit asPair: ((Int, Iterable[A])) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate

  132. def unzip3[A1, A2, A3](implicit asTriple: ((Int, Iterable[A])) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate

  133. val value: LayeredTopologicalOrder[A]

    Permalink
    Implicit information
    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

  134. def view(from: Int, until: Int): TraversableView[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]]

    Permalink
    Definition Classes
    TraversableLike

  135. def view: TraversableView[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]]

    Permalink
    Definition Classes
    TraversableLike

  136. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  137. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  138. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  139. def withFilter(p: ((Int, Iterable[A])) ⇒ Boolean): FilterMonadic[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic

  140. def withLayerOrdering(newOrdering: GraphTraversal.NodeOrdering): LayeredTopologicalOrder[A]

    Permalink

    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.

    Definition Classes
    LayeredTopologicalOrder → AbstractTopologicalOrder

  141. def ~[N >: N1](n2: N): UnDiEdge[N]

    Permalink
    Implicit information
    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()

  142. def ~>[N >: N1](n2: N): DiEdge[N]

    Permalink
    Implicit information
    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()

  143. def →[B](y: B): (LayeredTopologicalOrder[A], B)

    Permalink
    Implicit information
    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

  1. def filter(p: ((Int, Iterable[A])) ⇒ Boolean): TraversableOnce[(Int, Iterable[A])]

    Permalink
    Implicit information
    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

  2. def flatMap[B](f: ((Int, Iterable[A])) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Permalink
    Implicit information
    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

  3. def map[B](f: ((Int, Iterable[A])) ⇒ B): TraversableOnce[B]

    Permalink
    Implicit information
    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

  4. def stringPrefix: String

    Permalink
    Implicit information
    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

  5. def toString(): String

    Permalink
    Implicit information
    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

  6. def withFilter(p: ((Int, Iterable[A])) ⇒ Boolean): Iterator[(Int, Iterable[A])]

    Permalink
    Implicit information
    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

Inherited from AbstractTopologicalOrder[A, (Int, Iterable[A])]

Inherited from AbstractTraversable[(Int, Iterable[A])]

Inherited from Traversable[(Int, Iterable[A])]

Inherited from GenTraversable[(Int, Iterable[A])]

Inherited from GenericTraversableTemplate[(Int, Iterable[A]), Traversable]

Inherited from TraversableLike[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]]

Inherited from GenTraversableLike[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]]

Inherited from Parallelizable[(Int, Iterable[A]), ParIterable[(Int, Iterable[A])]]

Inherited from TraversableOnce[(Int, Iterable[A])]

Inherited from GenTraversableOnce[(Int, Iterable[A])]

Inherited from FilterMonadic[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]]

Inherited from HasNewBuilder[(Int, Iterable[A]), Traversable[(Int, Iterable[A])]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from LayeredTopologicalOrder[A] to OuterNode[LayeredTopologicalOrder[A]]

Inherited by implicit conversion CollectionsHaveToParArray from LayeredTopologicalOrder[A] to CollectionsHaveToParArray[LayeredTopologicalOrder[A], T]

Inherited by implicit conversion MonadOps from LayeredTopologicalOrder[A] to MonadOps[(Int, Iterable[A])]

Inherited by implicit conversion EdgeAssoc from LayeredTopologicalOrder[A] to EdgeAssoc[LayeredTopologicalOrder[A]]

Inherited by implicit conversion any2stringadd from LayeredTopologicalOrder[A] to any2stringadd[LayeredTopologicalOrder[A]]

Inherited by implicit conversion StringFormat from LayeredTopologicalOrder[A] to StringFormat[LayeredTopologicalOrder[A]]

Inherited by implicit conversion Ensuring from LayeredTopologicalOrder[A] to Ensuring[LayeredTopologicalOrder[A]]

Inherited by implicit conversion ArrowAssoc from LayeredTopologicalOrder[A] to ArrowAssoc[LayeredTopologicalOrder[A]]

Inherited by implicit conversion alternateImplicit from LayeredTopologicalOrder[A] to ForceImplicitAmbiguity

Ungrouped