AbstractTopologicalOrder

abstract def foreach[U](f: (T) ⇒ U): Unit

abstract def layerOrdering: GraphTraversal.NodeOrdering

abstract val layers: Layers

abstract def toA: (NodeT) ⇒ A

abstract def toLayered: LayeredTopologicalOrder[A]

Creates a new flavor of this TopologicalOrder or LayeredTopologicalOrder that is traversable for its inner nodes zipped with their layers.

abstract def withLayerOrdering(newOrdering: GraphTraversal.NodeOrdering): AbstractTopologicalOrder[A, T]

Creates a new flavor of this TopologicalOrder or LayeredTopologicalOrder with nodes ordered by newOrdering within the layers.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

def ->[B](y: B): (AbstractTopologicalOrder[A, T], B)

def /:[B](z: B)(op: (B, T) ⇒ B): B

def :\[B](z: B)(op: (T, B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

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

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

def aggregate[B](z: B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def asParIterable: ParIterable[T]

def asParSeq: ParSeq[T]

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

def companion: GenericCompanion[Traversable]

def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: T](xs: Array[B]): Unit

def copyToArray[B >: T](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: T](dest: Buffer[B]): Unit

def count(p: (T) ⇒ Boolean): Int

def drop(n: Int): Traversable[T]

def dropWhile(p: (T) ⇒ Boolean): Traversable[T]

def ensuring(cond: (AbstractTopologicalOrder[A, T]) ⇒ Boolean, msg: ⇒ Any): AbstractTopologicalOrder[A, T]

def ensuring(cond: (AbstractTopologicalOrder[A, T]) ⇒ Boolean): AbstractTopologicalOrder[A, T]

def ensuring(cond: Boolean, msg: ⇒ Any): AbstractTopologicalOrder[A, T]

def ensuring(cond: Boolean): AbstractTopologicalOrder[A, T]

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

def exists(p: (T) ⇒ Boolean): Boolean

def filter(p: (T) ⇒ Boolean): Traversable[T]

def filterNot(p: (T) ⇒ Boolean): Traversable[T]

def finalize(): Unit

def find(p: (T) ⇒ Boolean): Option[T]

def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Traversable[B]

def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

def foldRight[B](z: B)(op: (T, B) ⇒ B): B

def forall(p: (T) ⇒ Boolean): Boolean

def formatted(fmtstr: String): String

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

final def getClass(): Class[_]

def groupBy[K](f: (T) ⇒ K): Map[K, Traversable[T]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: T

def headOption: Option[T]

def ifParSeq[R](isbody: (ParSeq[T]) ⇒ R): (TraversableOps[T])#Otherwise[R]

def init: Traversable[T]

def inits: Iterator[Traversable[T]]

def isDefined: Boolean

def isEdge: Boolean

def isEmpty: Boolean

def isIn: Boolean

final def isInstanceOf[T0]: Boolean

def isNode: Boolean

def isOut: Boolean

def isParIterable: Boolean

def isParSeq: Boolean

def isParallel: Boolean

final def isTraversableAgain: Boolean

def last: T

def lastOption: Option[T]

def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

def max[B >: T](implicit cmp: Ordering[B]): T

def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def min[B >: T](implicit cmp: Ordering[B]): T

def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def mkString: String

def mkString(sep: String): String

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

val n1: AbstractTopologicalOrder[A, T]

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[T, Traversable[T]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def nrOfLayers: Int

The number of layers of this topological order.

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

def par: ParIterable[T]

def parCombiner: Combiner[T, ParIterable[T]]

def partition(p: (T) ⇒ Boolean): (Traversable[T], Traversable[T])

def product[B >: T](implicit num: Numeric[B]): B

def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: T](op: (B, T) ⇒ B): B

def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: T](op: (T, B) ⇒ B): B

def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

def repr: Traversable[T]

def reversed: List[T]

def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[T], B, That]): That

def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

def seq: Traversable[T]

def size: Int

def slice(from: Int, until: Int): Traversable[T]

def span(p: (T) ⇒ Boolean): (Traversable[T], Traversable[T])

def splitAt(n: Int): (Traversable[T], Traversable[T])

def stringPrefix: String

def sum[B >: T](implicit num: Numeric[B]): B

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

def tail: Traversable[T]

def tails: Iterator[Traversable[T]]

def take(n: Int): Traversable[T]

def takeWhile(p: (T) ⇒ Boolean): Traversable[T]

def thisCollection: Traversable[T]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: T]: Buffer[B]

def toCollection(repr: Traversable[T]): Traversable[T]

def toIndexedSeq: IndexedSeq[T]

def toIterable: Iterable[T]

def toIterator: Iterator[T]

def toList: List[T]

def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]

def toParArray: ParArray[T]

def toSeq: Seq[T]

def toSet[B >: T]: Set[B]

def toStream: Stream[T]

def toString(): String

def toTraversable: Traversable[T]

def toVector: Vector[T]

def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]

def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])

val value: AbstractTopologicalOrder[A, T]

def view(from: Int, until: Int): TraversableView[T, Traversable[T]]

def view: TraversableView[T, Traversable[T]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, Traversable[T]]

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

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

def →[B](y: B): (AbstractTopologicalOrder[A, T], B)

def filter(p: (T) ⇒ Boolean): TraversableOnce[T]

def flatMap[B](f: (T) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

def map[B](f: (T) ⇒ B): TraversableOnce[B]

val self: Any

val self: Any

def stringPrefix: String

def toString(): String

def withFilter(p: (T) ⇒ Boolean): Iterator[T]

def /:\[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

def x: AbstractTopologicalOrder[A, T]

def x: AbstractTopologicalOrder[A, T]