NodeSet

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def &(that: GenSet[NodeT]): Set[NodeT]

def &~(that: GenSet[NodeT]): Set[NodeT]

def +(elem1: NodeT, elem2: NodeT, elems: NodeT*): Set[NodeT]

def +(elem: NodeT): Set[NodeT]

def ++(xs: GenTraversableOnce[NodeT]): Set[NodeT]

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

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

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

def ++=(xs: TraversableOnce[NodeT]): NodeSet.this.type

def +=(edge: DefaultGraphImpl.EdgeT): NodeSet.this.type

final def +=(node: NodeT): NodeSet.this.type

def +=(elem1: NodeT, elem2: NodeT, elems: NodeT*): NodeSet.this.type

final def -(node: NodeT): DefaultGraphImpl.NodeSetT

def -(elem1: NodeT, elem2: NodeT, elems: NodeT*): Set[NodeT]

def --(xs: GenTraversableOnce[NodeT]): Set[NodeT]

def --=(xs: TraversableOnce[NodeT]): NodeSet.this.type

def -=(edge: DefaultGraphImpl.EdgeT): NodeSet.this.type

final def -=(node: NodeT): NodeSet.this.type

def -=(elem1: NodeT, elem2: NodeT, elems: NodeT*): NodeSet.this.type

final def -?(node: NodeT): DefaultGraphImpl.NodeSetT

final def -?=(node: NodeT): NodeSet.this.type

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

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

def <<(cmd: Message[NodeT]): Unit

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def add(node: NodeT): Boolean

def add(edge: DefaultGraphImpl.EdgeT): 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 adjacencyListsToString: String

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

def andThen[A](g: (Boolean) ⇒ A): (NodeT) ⇒ A

def apply(elem: NodeT): Boolean

final def asInstanceOf[T0]: T0

def asSortedString(separator: String)(implicit ord: DefaultGraphImpl.NodeOrdering): String

def canEqual(that: Any): Boolean

def checkedRemove(node: NodeT, ripple: Boolean): Boolean

generic constrained subtraction

def clear(): Unit

def clone(): Set[NodeT]

val coll: ExtHashSet[NodeT]

def collect[B, That](pf: PartialFunction[NodeT, B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That

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

def companion: GenericCompanion[Set]

def compose[A](g: (A) ⇒ NodeT): (A) ⇒ Boolean

final def contains(node: NodeT): Boolean

def copy: DefaultGraphImpl.NodeSetT

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

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

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

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

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

def diff(that: GenSet[NodeT]): Set[NodeT]

final def draw(random: Random): NodeT

def drop(n: Int): Set[NodeT]

def dropRight(n: Int): Set[NodeT]

def dropWhile(p: (NodeT) ⇒ Boolean): Set[NodeT]

def empty: Set[NodeT]

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

def filter(p: (NodeT) ⇒ Boolean): Set[NodeT]

def filterNot(p: (NodeT) ⇒ Boolean): Set[NodeT]

def finalize(): Unit

final def find(elem: N): Option[NodeT]

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

final def findEntry[B](other: B, correspond: (NodeT, B) ⇒ Boolean): NodeT

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

def flatten[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Set[B]

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

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

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

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

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

def from(that: AdjacencyListBase[N, E, DefaultGraphImpl])(delNodes: Iterable[immutable.AdjacencyListBase.NodeT], delEdges: Iterable[immutable.AdjacencyListBase.EdgeT], ripple: Boolean, addNodes: Iterable[N], addEdges: Iterable[E[N]]): Unit

def from(nodeStreams: Iterable[NodeInputStream[N]], nodes: Iterable[N], edgeStreams: Iterable[GenEdgeInputStream[N, E]], edges: Iterable[E[N]]): Unit

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

final def get(outer: N): NodeT

final def getClass(): Class[_]

def groupBy[K](f: (NodeT) ⇒ K): Map[K, Set[NodeT]]

def grouped(size: Int): Iterator[Set[NodeT]]

def handleNotGentlyRemovable: Boolean

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: NodeT

def headOption: Option[NodeT]

def init: Set[NodeT]

def initialize(nodes: Iterable[N], edges: Iterable[E[N]]): Unit

def inits: Iterator[Set[NodeT]]

def intersect(that: GenSet[NodeT]): Set[NodeT]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

final def iterator: Iterator[NodeT]

def last: NodeT

def lastOption: Option[NodeT]

final def lookup(elem: N): NodeT

def map[B, That](f: (NodeT) ⇒ B)(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That

def mapResult[NewTo](f: (Set[NodeT]) ⇒ NewTo): Builder[NodeT, NewTo]

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

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

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

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

def minus(node: NodeT): Unit

def minusEdges(node: NodeT): Unit

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[NodeT, Set[NodeT]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParSet[NodeT]

def parCombiner: Combiner[NodeT, ParSet[NodeT]]

def partition(p: (NodeT) ⇒ Boolean): (Set[NodeT], Set[NodeT])

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

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

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

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

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

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

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

def remove(node: NodeT): Boolean

def remove(edge: DefaultGraphImpl.EdgeT): Boolean

def removeGently(node: NodeT): Boolean

def repr: Set[NodeT]

def result(): Set[NodeT]

def retain(p: (NodeT) ⇒ Boolean): Unit

def reversed: List[NodeT]

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

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

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

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

def seq: Set[NodeT]

def size: Int

def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

def sizeHint(coll: TraversableLike[_, _]): Unit

def sizeHint(size: Int): Unit

def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

def slice(from: Int, until: Int): Set[NodeT]

def sliding(size: Int, step: Int): Iterator[Set[NodeT]]

def sliding(size: Int): Iterator[Set[NodeT]]

def span(p: (NodeT) ⇒ Boolean): (Set[NodeT], Set[NodeT])

def splitAt(n: Int): (Set[NodeT], Set[NodeT])

def stringPrefix: String

def subsetOf(that: GenSet[NodeT]): Boolean

def subsets: Iterator[Set[NodeT]]

def subsets(len: Int): Iterator[Set[NodeT]]

final def subtract(node: NodeT, rippleDelete: Boolean, minusNode: (NodeT) ⇒ Unit, minusEdges: (NodeT) ⇒ Unit): Boolean

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

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

def tail: Set[NodeT]

def tails: Iterator[Set[NodeT]]

def take(n: Int): Set[NodeT]

def takeRight(n: Int): Set[NodeT]

def takeWhile(p: (NodeT) ⇒ Boolean): Set[NodeT]

def thisCollection: Iterable[NodeT]

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

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

def toBuffer[A1 >: NodeT]: Buffer[A1]

def toCollection(repr: Set[NodeT]): Iterable[NodeT]

def toIndexedSeq: IndexedSeq[NodeT]

def toIterable: Iterable[NodeT]

def toIterator: Iterator[NodeT]

def toList: List[NodeT]

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

def toNodeInSet: Set[N]

def toSeq: Seq[NodeT]

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

def toSortedString(separator: String)(implicit ord: DefaultGraphImpl.NodeOrdering): String

def toStream: Stream[NodeT]

def toString(): String

def toTraversable: Traversable[NodeT]

def toVector: Vector[NodeT]

def transpose[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Set[Set[B]]

def union(that: GenSet[NodeT]): Set[NodeT]

def unzip[A1, A2](implicit asPair: (NodeT) ⇒ (A1, A2)): (Set[A1], Set[A2])

def unzip3[A1, A2, A3](implicit asTriple: (NodeT) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

def update(elem: NodeT, included: Boolean): Unit

def view(from: Int, until: Int): IterableView[NodeT, Set[NodeT]]

def view: IterableView[NodeT, Set[NodeT]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (NodeT) ⇒ Boolean): FilterMonadic[NodeT, Set[NodeT]]

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

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

def zipWithIndex[A1 >: NodeT, That](implicit bf: CanBuildFrom[Set[NodeT], (A1, Int), That]): That

def |(that: GenSet[NodeT]): Set[NodeT]

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