ArrayBasedDirectedGraph

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

def :\[B](z: B)(op: (Node, 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, Node) ⇒ B, combop: (B, B) ⇒ B): B

def approxStorageComplexity(): Long

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[Iterable[Node], B, That]): That

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

def companion: GenericCompanion[Iterable]

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

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

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

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

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

def drop(n: Int): Iterable[Node]

def dropRight(n: Int): Iterable[Node]

def dropWhile(p: (Node) ⇒ Boolean): Iterable[Node]

val edgeCount: Long

the number of edges in the graph

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

def existsNodeId(id: Int): Boolean

def filter(p: (Node) ⇒ Boolean): Iterable[Node]

def filterNot(p: (Node) ⇒ Boolean): Iterable[Node]

def finalize(): Unit

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

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

def flatten[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): Iterable[B]

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

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

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

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

def foreach[U](f: (Node) ⇒ U): Unit

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

final def getClass(): Class[_]

def getNodeById(id: Int): Option[Node]

Returns the node with the given id or else None if the given node does not exist in this graph.

def groupBy[K](f: (Node) ⇒ K): Map[K, Iterable[Node]]

def grouped(size: Int): Iterator[Iterable[Node]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Node

def headOption: Option[Node]

def init: Iterable[Node]

def inits: Iterator[Iterable[Node]]

def isDirStored(dir: GraphDir): Boolean

Checks if the given graph dir is stored in this graph

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Node]

def last: Node

def lastOption: Option[Node]

def map[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Node], B, That]): That

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

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

lazy val maxNodeId: Int

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

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

def mkString: String

def mkString(sep: String): String

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

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[Node, Iterable[Node]]

val nodeCount: Int

the number of nodes in the graph

val nodeWithOutEdgesCount: Int

val nodeWithOutEdgesMaxId: Int

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[Node]

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

def partition(p: (Node) ⇒ Boolean): (Iterable[Node], Iterable[Node])

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

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

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

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

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

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

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

def repr: Iterable[Node]

def reversed: List[Node]

def sameElements[B >: Node](that: GenIterable[B]): Boolean

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

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

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

def seq: Iterable[Node]

def size: Int

def slice(from: Int, until: Int): Iterable[Node]

def sliding(size: Int, step: Int): Iterator[Iterable[Node]]

def sliding(size: Int): Iterator[Iterable[Node]]

def span(p: (Node) ⇒ Boolean): (Iterable[Node], Iterable[Node])

def splitAt(n: Int): (Iterable[Node], Iterable[Node])

val storedGraphDir: StoredGraphDir

the graph direction(s) stored

def stringPrefix: String

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

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

def tail: Iterable[Node]

def tails: Iterator[Iterable[Node]]

def take(n: Int): Iterable[Node]

def takeRight(n: Int): Iterable[Node]

def takeWhile(p: (Node) ⇒ Boolean): Iterable[Node]

def thisCollection: Iterable[Node]

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

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

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

def toCollection(repr: Iterable[Node]): Iterable[Node]

def toIndexedSeq: IndexedSeq[Node]

def toIterable: Iterable[Node]

def toIterator: Iterator[Node]

def toList: List[Node]

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

def toSeq: Seq[Node]

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

def toStream: Stream[Node]

def toString(numNodes: Int): String

def toString(): String

Added default toString for debugging (prints max of 10 nodes)

def toTraversable: Traversable[Node]

def toVector: Vector[Node]

def transpose[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def unzip[A1, A2](implicit asPair: (Node) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (Node) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def view(from: Int, until: Int): IterableView[Node, Iterable[Node]]

def view: IterableView[Node, Iterable[Node]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, Iterable[Node]]

def zip[A1 >: Node, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[Node], (A1, B), That]): That

def zipAll[B, A1 >: Node, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[Node], (A1, B), That]): That

def zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[Iterable[Node], (A1, Int), That]): That

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